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

 

标志
提示
(来自的问候整数序列在线百科全书!)
A233682型 T(n,k)=(n+1)X(k+1)0..3数组的数量,每个2X2子块的边差平方和等于6(6使T(1,1)最大化) 9
48, 184, 184, 648, 928, 648, 2440, 4448, 4448, 2440, 8712, 23568, 28544, 23568, 8712, 32456, 117744, 216592, 216592, 117744, 32456, 116872, 621904, 1500800, 2442208, 1500800, 621904, 116872, 432456, 3145968, 11482368, 25036784, 25036784 (列表;桌子;图表;参考;;历史;文本;内部格式)
抵消
1,1
评论
表格开始
......48.......184.........648..........2440............8712.............32456
.....184.......928........4448.........23568..........117744............621904
.....648......4448.......28544........216592.........1500800..........11482368
....2440.....23568......216592.......2442208........25036784.........289389648
....8712....117744.....1500800......25036784.......365293440........6336415296
...32456....621904....11482368.....289389648......6336415296......169016684160
..116872...3145968....81243904....3057995568.....95799636288.....3879764059776
..432456..16510480...617735680...35239626640...1660462199232...103768584198400
.1565704..84078896..4416166400..377551693872..25500227965248..2432577744933760
.5768392.439062352.33345630720.4321333099024.438642994287168.64581965636210432
链接
配方奶粉
k列的经验值:
k=1:a(n)=a(n-1)+12*a(n-2)-4*a(n3)-16*a(n-4)
k=2:[顺序10]
k=3:[订单17]
k=4:[订单45]
k=5:[顺序99]
例子
n=3k=4的一些解
..0..2..0..2..0....1..1..1..2..1....0..1..3..1..0....0..0..0..2..3
..0..1..0..1..0....0..2..0..2..3....0..2..2..2..2....1..2..1..2..1
..2..1..2..1..2....0..1..1..2..1....0..1..0..1..3....0..2..3..2..0
..2..3..3..1..3....2..2..3..2..3....0..2..2..2..2....0..1..3..1..1
交叉参考
关键词
非n,
作者
R.H.哈丁2013年12月14日
状态
已批准

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

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

上次修改时间:美国东部夏令时2024年4月24日20:08。包含371963个序列。(在oeis4上运行。)