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

 


A223387型
T(n,k)=所有水平或垂直连接的相等值都在一条直线上的nXk 0..2数组的数量,新值0..2按行主顺序引入
8
1, 2, 2, 5, 9, 5, 14, 57, 57, 14, 41, 366, 777, 366, 41, 122, 2358, 10830, 10830, 2358, 122, 365, 15204, 151962, 329840, 151962, 15204, 365, 1094, 98052, 2136444, 10139432, 10139432, 2136444, 98052, 1094, 3281, 632376, 30053580, 312609528, 684434305
抵消
1,2
评论
表格开始
.....1..........2..............5.................14.....................41
.....2..........9.............57................366...................2358
.....5.........57............777..............10830.................151962
....14........366..........10830.............329840...............10139432
....41.......2358.........151962...........10139432..............684434305
...122......15204........2136444..........312609528............46377822217
...365......98052.......30053580.........9647052880..........3146553746804
..1094.....632376......422837280.......297793167360........213569806424579
..3281....4078488.....5949375984......9193379042784......14497860201301485
..9842...26304144....83709684792....283823521300032.....984209549790487316
.29525..169648272..1177827765240...8762451963477680...66815578146284698253
.88574.1094144736.16572513858312.270523002967477744.4535968556179629648389
链接
配方奶粉
k列的经验值:
k=1:a(n)=4*a(n-1)-3*a(n-2)
k=2:a(n)=8*a(n-1)-10*a(n-2),对于n>3
k=3:a(n)=19*a(n-1)-72*a(n-2)+34*a(n-3)+44*a
k=4:对于n>10,[顺序9]
k=5:对于n>24,[订单23]
例子
n=3k=4的一些解
..0..1..2..2....0..0..1..2....0..1..0..1....0..1..2..1....0..0..0..0
..1..2..1..1....1..2..2..0....0..2..1..2....1..2..0..2....1..1..2..1
..0..2..0..2....0..0..1..0....2..0..0..0....2..1..2..1....0..2..0..2
关键字
非n,
作者
R.H.哈丁2013年3月19日
状态
经核准的

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

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

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