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

 

标志
提示
(来自的问候整数序列在线百科全书!)
211853英镑 长度为2n+8的非负整数数组的数量,按顺序引入新值0向上,没有三个相邻元素都不相等,并且包含值n+1。 1
1731, 6936, 21897, 57913, 134164, 280751, 542235, 981675, 1685165, 2766870, 4374561, 6695649, 9963718, 14465557, 20548691, 28629411, 39201303, 52844276, 70234089, 92152377, 119497176, 153293947, 194707099, 245052011, 305807553 (列表;图表;参考;;历史;文本;内部格式)
抵消
1,1
评论
第7行,共行211849英镑.
链接
配方奶粉
经验:a(n)=(499/720)*n^6+(2587/240)*n*5+(10031/144)*n_4+(11681/48)*n_3+(179153/360)*n_2+(8788/15)*n+323。
推测来自科林·巴克2018年7月20日:(开始)
通用格式:x*(1731-5181*x+9696*x^2-10295*x^3+6435*x^4-2210*x^5+323*x^6)/(1-x)^7。
当n>7时,a(n)=7*a(n-1)-21*a。
(结束)
例子
n=3的一些解决方案:
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..1....1....1....1....1....0....1....1....1....0....1....1....0....1....1....1
..1....1....1....1....0....1....1....1....1....1....1....1....1....0....1....1
..2....2....1....2....1....0....1....2....2....1....2....2....1....0....2....1
..2....2....2....2....1....0....2....2....2....2....2....2....2....2....2....2
..3....2....2....2....2....2....2....3....3....1....0....3....2....0....3....2
..3....3....2....3....1....2....2....3....2....1....0....3....3....2....2....2
..2....3....3....3....2....3....2....4....2....3....0....1....3....2....3....3
..3....4....3....4....2....3....3....4....2....3....3....1....4....3....3....2
..3....3....3....4....2....4....2....5....4....3....3....4....3....3....4....2
..4....4....4....2....2....4....2....5....4....3....3....4....4....4....4....4
..3....3....4....2....3....2....4....6....0....4....4....1....4....3....0....4
..3....3....4....2....3....2....4....6....0....3....4....1....5....3....0....0
..4....4....0....3....4....3....5....2....5....4....0....0....4....0....0....4
交叉参考
囊性纤维变性。A211849型.
关键词
非n
作者
R.H.哈丁2012年4月22日
状态
已批准

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

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

上次修改时间:美国东部夏令时2024年4月25日10:51。包含371967个序列。(在oeis4上运行。)