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

 

标志
提示
(来自的问候整数序列在线百科全书!)
搜索: a212227-编号:a212227
显示1-1个结果(共1个)。 第页1
    排序:关联|参考文献||被改进的|创建     格式:长的|短的|数据
A242144型 T(n,k)=长度n+5 0..k数组的数量,没有连续六个元素的总和超过3*k +10
12
42, 435, 74, 2338, 1113, 132, 8688, 7862, 2902, 236, 25494, 36224, 27024, 7596, 421, 63490, 126894, 154647, 93308, 19834, 747, 140148, 367358, 647404, 663395, 321320, 51440, 1314, 282051, 924300, 2180310, 3319500, 2837837, 1098260, 131950, 2318 (列表桌子图表参考历史文本内部格式)
抵消
1,1
评论
表格开始
...42....435....2338.....8688.....25494......63490......140148......282051
...74...1113....7862....36224....126894.....367358......924300.....2088459
..132...2902...27024...154647....647404....2180310.....6256170....15876783
..236...7596...93308...663395...3319500...13006484....42564898...121330981
..421..19834..321320..2837837..16970962...77357343...288712815...924335053
..747..51440.1098260.12043599..86052208..456215409..1941492045..6980495147
.1314.131950.3708268.50455611.430518585.2653766000.12874102578.51971761446
链接
配方奶粉
k列的经验值:
k=1:[20阶线性递归]
第n行的经验值:
n=1:[六次多项式]
n=2:[七次多项式]
n=3:[八次多项式]
n=4:[九次多项式]
n=5:[10次多项式]
n=6:[11次多项式]
n=7:[十二次多项式]
例子
n=3k=4的一些解
..2....1....0....0....0....2....0....0....0....0....2....0....1....0....1....2
..1....0....0....3....3....3....3....0....3....2....2....4....3....3....0....1
..1....1....4....2....1....0....0....4....1....0....1....3....1....2....1....0
..4....3....0....2....1....1....3....2....0....2....1....0....0....0....0....1
..1….0….3….2….3….1….1….0….4….0….1….0….1….1….1….1….1….1
..1....0....1....0....0....2....4....1....1....0....4....2....4....3....2....4
..1....1....0....2....0....4....0....1....1....2....3....1....2....0....1....0
..1....2....3....3....2....1....1....3....3....1....1....2....0....1....2....3
交叉参考
第1列是133551英镑(n+5)
第2列为A212227号
关键词
非n,
作者
R.H.哈丁2014年5月5日
状态
经核准的
第页1

搜索在0.008秒内完成

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

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

上次修改时间:美国东部夏令时2024年4月19日09:23。包含371782个序列。(在oeis4上运行。)