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

 

标志
提示
(来自的问候整数序列在线百科全书!)
A212232型 T(n,k)=任意长度2k子序列中长度为n+2*k-1且总和不超过2*k的0..2个阵列的数量(=50%占空比) 14
6, 50, 14, 435, 124, 31, 3834, 1113, 311, 70, 34001, 10002, 2902, 775, 157, 302615, 89911, 26637, 7596, 1895, 353, 2699598, 808403, 242780, 71427, 19834, 4663, 793, 24121674, 7269626, 2204646, 660796, 191853, 51440, 11518, 1782, 215786649 (列表;桌子;图表;参考;;历史;文本;内部格式)
抵消
1,1
评论
表格开始
....6....50....435....3834....34001....302615....2699598....24121674
...14...124...1113...10002....89911....808403....7269626....65380788
...31...311...2902...26637...242780...2204646...19976155...180744711
...70...775...7596...71427...660796...6062948...55360211...503916387
..157..1895..19834..191853..1804448..16740414..154089343..1411275807
..353..4663..51440..514687..4931630..46305966..429886243..3962696059
..793.11518.131950.1376128.13468524.128148456.1200645159.11143104246
.1782.28446.339564.3659968.36711516.354470546.3354267511.31356940932
链接
例子
n=3k=4的一些解
..1....2....2....1....2....0....1....2....2....1....1....2....0....0....1....1
..1....0....0....1....1....1....0....2....2....0....0....2....0....1....1....1
..1....2....2....0....0....0....0....1....0....1....0....0....1....0....0....2
..0....0....1....1....1....2....2....1....1....1....0....0....1....0....1....1
..0....1....0....0....1....2....0....1....1....1....0....1....0....1....1....2
..0....0....2....1....1....0....1....1....1....1....1....2....1....0....0....0
..1....1....0....1....1....0....0....0....0....2....2....1....0....2....1....0
..1....1....0....1....0....0....0....0....0....0....2....0....1....1....1....0
..1....1....1....1....1....1....0....1....1....1....2....0....0....1....0....0
..0....1....2....2....2....0....0....2....1....1....1....1....2....1....0....1
交叉参考
第1列是A006356号(n+1)
关键词
非n,
作者
R.H.哈丁2012年5月6日
状态
已批准

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

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

上次修改时间:2024年4月25日03:15 EDT。包含371964个序列。(在oeis4上运行。)