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

 


A233818型
T(n,k)=(n+1)X(k+1)0..5个数组的数量,每个2X2子块的所有六条边的平方和和对角线差等于11(11使T(1,1)最大化)
8
96, 428, 428, 1824, 2216, 1824, 8136, 10972, 10972, 8136, 34848, 59164, 61896, 59164, 34848, 155488, 301132, 403108, 403108, 301132, 155488, 667200, 1671748, 2384304, 3261172, 2384304, 1671748, 667200, 2977440, 8669484, 16476460, 23737972
抵消
1,1
评论
表格开始
.......96........428........1824..........8136..........34848.........155488
......428.......2216.......10972.........59164.........301132........1671748
.....1824......10972.......61896........403108........2384304.......16476460
.....8136......59164......403108.......3261172.......23737972......208935048
....34848.....301132.....2384304......23737972......203778336.....2269466400
...155488....1671748....16476460.....208935048.....2269466400....32723763904
...667200....8669484...100402408....1586833704....20442834720...376273555864
..2977440...49193332...727727388...15004751648...252044188760..6112734012140
.12787200..258472076..4526565112..117407564852..2344074621648.72958370707804
.57068480.1489731188.34009964384.1174169462004.31455090410644
链接
配方奶粉
第k列的经验值:
k=1:a(n)=30*a(n-2)-220*a(n-4)+240*a(n-6)
k=2:[订单18]
k=3:【订单78】
例子
n=3k=4的一些解
..0..0..2..2..3....3..1..0..1..0....3..1..3..5..5....0..1..0..2..2
..2..1..0..1..3....1..2..0..2..2....3..2..3..4..3....2..0..2..1..0
..0..2..0..2..3....0..2..1..0..1....2..4..2..2..2....0..1..0..2..2
..2..1..2..1..1....1..0..2..2..0....2..3..4..3..4....0..2..0..1..0
关键词
非n,
作者
R.H.哈丁2013年12月16日
状态
经核准的

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

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

上次修改时间:美国东部夏令时2024年9月22日05:46。包含376097个序列。(在oeis4上运行。)