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

 


A260138型
T(n,k)=(n+2)X(k+2)0..1阵列的数量,每个3X3子块具有顺时针周长图案00010101010101或01010111
9
36, 58, 58, 138, 128, 138, 266, 342, 342, 266, 472, 730, 1162, 730, 472, 944, 1626, 2966, 2966, 1626, 944, 1880, 3928, 7698, 8292, 7698, 3928, 1880, 3562, 8998, 22522, 24696, 24696, 22522, 8998, 3562, 6866, 20376, 61914, 85048, 89000, 85048, 61914, 20376
抵消
1,1
评论
表格开始
....36.....58.....138.....266......472.......944.......1880........3562
....58....128.....342.....730.....1626......3928.......8998.......20376
...138....342....1162....2966.....7698.....22522......61914......165954
...266....730....2966....8292....24696.....85048.....266156......813540
...472...1626....7698...24696....89000....365308....1340176.....4872072
...944...3928...22522...85048...365308...1799114....7839850....33893514
..1880...8998...61914..266156..1340176...7839850...39696994...200149838
..3562..20376..165954..813540..4872072..33893514..200149838..1187010782
..6866..47424..462030.2626092.18722120.155470816.1081436482..7587636740
.13450.109650.1279574.8360396.70481648.697051946.5672351526.46772091478
链接
配方奶粉
第k列的经验值:
k=1:a(n)=a(n-1)+3*a(n-3)+a(n-4),对于n>5
k=2:a(n)=a(n-1)+a(n-2)+5*a(n-3)+a
k=3:n>10时[顺序9]
k=4:对于n>13,[顺序12]
k=5:对于n>25,[订单24]
k=6:对于n>32,[订单30]
k=7:对于n>44,[订单42]
例子
n=4k=4的一些解
..1..1..0..1..0..1....1..1..0..0..0..1....1..1..0..1..0..0....0..0..0..1..1..1
..1..1..1..0..1..0....1..0..1..0..1..0....1..0..1..0..0..0....1..0..1..0..1..0
..0..1..0..1..0..1....0..1..0..1..0..1....0..1..0..1..0..1....0..1..0..1..0..1
..1..0..1..0..1..0....1..0..1..0..1..0....1..0..1..0..1..0....1..0..1..0..1..0
..0..1..0..1..0..1....1..1..0..1..0..0....0..0..0..1..0..1....1..1..0..1..0..1
..1..0..0..0..1..1....1..0..1..0..1..0....0..0..1..0..0..0....1..0..1..0..0..0
关键词
非n,
作者
R.H.哈丁2015年7月17日
状态
经核准的

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

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

上次修改时间:2024年9月21日22:57 EDT。包含376090个序列。(在oeis4上运行。)