登录
OEIS由OEIS基金会的许多慷慨捐赠者.

 


A250087型
长度为6+5 0..n的数组的数量,每六个连续项中有两个项的最大值等于其余四个项中的最小值
1
774, 25659, 315376, 2170435, 10384566, 38804209, 121263104, 330977421, 812445670, 1830978831, 3846189744, 7617096799, 14347945366, 25885421205, 44979623296, 75622979129, 123483223494, 196448622211, 305305805040
抵消
1,1
评论
第6行,共行A250081型
链接
配方奶粉
经验公式:a(n)=(85/252)*n^9+(1445/168)*n*8+(347/7)*n_7+(361/3)*n~6+(631/4)*n_25+(3775/24)*n~4+(9602/63)*n_3+(8381/84)*n ^2+(377/14)*n+1
例子
n=2的一些解
..2....2....0....2....1....2....2....1....1....0....2....1....1....2....1....1
..1....0....1....0....1....1....1....0....2....2....0....0....1....2....2....0
..0....1....1....1....0....1....1....2....0....1....0....2....0....1....1....0
..1....0....0....1....0....1....0....2....0....0....0....2....1....0....2....1
..0....1....0....1....2....1....0....1....1....1....0....0....1....0....0....1
..0....0....1....1....0....0....0....1....0....0....2....0....1....0....2....0
..2....0....0....2....1....1....0....1....2....0....0....0....1....0....1....2
..2....0....2....2....0....2....2....1....1....1....0....2....1....0....1....0
..0....0....2....2....2....2....1....0....0....0....0....2....0....1....1....0
..0....0....0....0....0....2....2....2....0....0....1....0....2....0....1....0
..1....2....0....1....2....1....0....1....2....2....2....0....1....1....2....0
关键词
非n
作者
R.H.哈丁2014年11月11日
状态
经核准的

查找|欢迎光临|维基|注册|音乐|地块2|演示|索引|浏览|网络摄像头
贡献新序列。或评论|格式|样式表|变换|超级搜索|最近
OEIS社区|维护人OEIS基金会。

许可协议、使用条款、隐私政策。.

上次修改时间:2024年9月20日01:57 EDT。包含376015个序列。(在oeis4上运行。)