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

 

标志
提示
(来自的问候整数序列在线百科全书!)
A250066型 长度为7+6 0..n的数组的数量,其中没有七个连续项,任何两个项的最大值等于其余五个项的最小值。 1
21, 21276, 2398187, 81138873, 1329866076, 13468748489, 96884873906, 539919000270, 2469626954391, 9653001714762, 33196888242117, 102660657566831, 290292185100918, 760444039774479, 1864760913276308, 4316829401163980 (列表图表参考历史文本内部格式)
抵消
1,1
评论
第7行,共7行A250059型.
链接
配方奶粉
经验:a(n)=n^13-(3403/2772)*n^12+(261607/27720/4620)*编号。
经验公式:x*(21+20982*x+2102234*x^2+49492727*x^3+404433428*x^4+1382576034*x^5+2163711902*x^6+1598287676*x^7+544743783*x^8+77937032*x^9+368780*x^10+27181*x^11)/(1-x)^14-科林·巴克2017年9月8日
例子
n=2的一些解
..1....2....1....2....2....1....1....2....0....2....0....0....0....2....2....2
..1....2....0....2....2....1....0....1....2....2....2....2....1....2....2....0
..2....2....0....0....2....1....2....1....1....1....2....1....2....0....2....2
..1....1....2....1....2....0....1....2....2....0....2....1....0....2....0....2
..2....2....2....2....1....0....1....1....0....0....2....2....2....2....1....2
..0....2....2....2....2....2....2....0....1....2....1....1....2....1....2....1
..0....0....1....2....0....2....0....0....1....2....0....0....2....2....2....2
..2....2....2....2....0....1....1....1....0....1....0....0....0....0....0....0
..2....2....2....2....1....2....0....1....2....1....2....2....1....1....2....2
..1....0....0....0....2....2....1....2....2....2....1....1....2....0....2....0
..1....2....2....0....2....2....2....1....2....0....1....2....0....1....0....2
..1....2....2....1....1....1....1....1....0....0....2....2....1....2....2....1
..0....1....2....1....2....2....2....0....1....2....2....2....2....1....1....2
交叉参考
关键词
非n
作者
R.H.哈丁2014年11月11日
状态
经核准的

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

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

上次修改时间:2024年4月19日23:40 EDT。包含371798个序列。(在oeis4上运行。)