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

 


A183328号
T(n,k)=nXk二进制数组的数量,每个1正好与另外两个1相邻
6
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 6, 10, 10, 6, 1, 1, 9, 19, 27, 19, 9, 1, 1, 13, 37, 72, 72, 37, 13, 1, 1, 19, 69, 179, 289, 179, 69, 19, 1, 1, 28, 129, 447, 996, 996, 447, 129, 28, 1, 1, 41, 244, 1139, 3325, 4740, 3325, 1139, 244, 41, 1, 1, 60, 460, 2912, 11415, 21259
抵消
1,5
评论
表格开始
.1..1...1....1......1.......1........1.........1..........1...........1
.1..2...3....4......6.......9.......13........19.........28..........41
.1..3...6...10.....19......37.......69.......129........244.........460
.1..4..10...27.....72.....179......447......1139.......2912........7434
.1..6..19...72....289.....996.....3325.....11415......39720......138689
.1..9..37..179....996....4740....21259.....96524.....443793.....2054180
.1.13..69..447...3325...21259...128371....770542....4639132....28160294
.1.19.129.1139..11415...96524...770542...6115158...48449560...386449543
.1.28.244.2912..39720..443793..4639132..48449560..505971397..5319953708
.1.41.460.7434.138689.2054180.28160294.386449543.5319953708.73890230419
链接
例子
7X6的一些解决方案
..0..1..1..1..1..1....0..0..1..1..1..0....0..0..1..1..1..1....0..0..1..1..1..0
..0..1..0..0..0..1....0..1..1..0..1..0....1..1..1..0..0..1....0..0..1..0..1..0
..0..1..0..1..1..1....1..1..0..0..1..1....1..0..0..0..0..1....1..1..1..0..1..1
..0..1..0..1..0..0....1..0..0..0..0..1....1..1..0..0..0..1....1..0..0..0..0..1
..1..1..0..1..1..0....1..0..0..0..1..1....0..1..0..0..0..1....1..1..0..0..0..1
..1..0..0..0..1..0....1..0..1..1..1..0....0..1..1..1..0..1....0..1..1..0..0..1
..1..1..1..1..1..0....1..1..1..0..0..0....0..0..0..1..1..1....0..0..1..1..1..1
关键字
非n,
作者
R.H.哈丁2011年1月3日
状态
经核准的

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

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

上次修改时间:美国东部夏令时2024年9月21日04:44。包含376079个序列。(在oeis4上运行。)