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

 

标志
提示
(来自的问候整数序列在线百科全书!)
A249967型 长度为7+50..n的数组的数量,其中没有六个连续项,任何两个项的最大值等于其余四个项的最小值。 1
15, 8823, 709814, 18707320, 251002319, 2149795141, 13385651492, 65717571120, 268511791119, 948021599547, 2972106528666, 8443442678840, 22076610372895, 53774915777897, 123215084622184, 267660712891040, 554792683762767 (列表;图表;参考;;历史;文本;内部格式)
抵消
1,1
评论
第7行,共行249960加元.
链接
公式
经验:a(n)=n^12-(53/42)*n^11+(1404/175)*n*10-(8593/1260)*n*9+(8647/1260)*n^8+(3511/252)*n_7-(43133/1800)*n~6+(41323/2520)*n_25+(21641/2520)*n_4-(2225/168)*n_3+(7339/1050)*n~2-(158/105)*n。
推测来自科林·巴克2017年8月21日:(开始)
通用编号:x*(15+8628*x+596285*x^2+10163642*x^3+6065998*x^4+149218290*x^5+162389570*x^6+78777198*x^7+16029715*x^8+114682*x^9+16577*x^10)/(1-x)^13。
当n>13时,a(n)=13*a(n-1)-78*a(n-2)+286*a(n-3)-715*a。
(结束)
例子
n=2的一些解决方案:
..0....1....2....2....0....1....2....0....0....0....1....0....1....0....0....2
..2....1....2....0....2....2....0....2....2....2....0....2....0....0....2....2
..0....2....0....2....2....0....2....1....0....1....0....2....1....1....2....2
..2....2....0....2....1....0....2....2....2....2....1....2....2....1....0....1
..1....2....1....1....2....1....2....1....2....2....1....1....0....2....2....0
..2....2....1....2....2....1....0....0....2....2....1....0....2....2....1....0
..2....0....1....0....1....2....1....0....0....0....1....2....2....0....0....1
..2....1....1....2....2....2....2....2....1....0....0....2....2....0....2....2
..0....0....0....2....2....0....0....2....0....1....0....0....1....2....1....2
..0....1....0....0....0....0....1....2....1....1....2....1....2....1....0....2
..1....2....1....1....2....2....2....1....2....1....1....1....1....1....2....2
..1....2....1....2....2....1....0....2....2....1....1....0....2....1....2....1
交叉参考
关键词
非n
作者
R.H.哈丁2014年11月9日
状态
经核准的

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

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

上次修改时间:美国东部夏令时2024年6月24日22:33。包含373690个序列。(在oeis4上运行。)