登录

年度呼吁:请向OEIS基金会捐款支持OEIS的持续开发和维护。现在是我们的第61年,我们有超过378000个序列,我们已经获得了11000条引文(通常说“多亏了OEIS才发现”)。

A234777号
T(n,k)=(n+1)X(k+1)0..4个数组的数量,在顺时针或逆时针方向中的一个方向上,2X2边跳跃都不超过+1
8
88, 454, 454, 2056, 3980, 2056, 10076, 28840, 28840, 10076, 46804, 247394, 301776, 247394, 46804, 226072, 1912554, 4255966, 4255966, 1912554, 226072, 1060636, 16146124, 49077768, 110820444, 49077768, 16146124, 1060636, 5086576, 127371542
抵消
1,1
评论
表格开始
........88.........454...........2056.............10076...............46804
.......454........3980..........28840............247394.............1912554
......2056.......28840.........301776...........4255966............49077768
.....10076......247394........4255966.........110820444..........2206072560
.....46804.....1912554.......49077768........2206072560.........66213980208
....226072....16146124......678552840.......56840484142.......2946351948550
...1060636...127371542.....8058197452.....1188633109208......92618616941276
...5086576..1063565190...109362379520....30017584986988....4021006772274008
..23991808..8483787204..1321852668660...646382184496458..129993575205738872
.114597900.70296753566.17679539166428.16032029328041480.5514507861007613210
链接
配方奶粉
k列的经验值:
k=1:a(n)=a(n-1)+21*a(n-2)-a(n-3)-67*a
k=2:[订单23]
k=3:[订单52]
例子
n=2k=4的一些解
..1..2..1..2..1....3..1..3..4..4....3..2..1..2..1....3..2..0..2..2
..0..2..3..2..3....2..2..3..2..3....1..2..0..3..4....0..1..1..1..3
..1..1..1..1..4....0..1..0..1..4....0..2..1..2..1....2..2..3..2..3
关键词
非n,
作者
R.H.哈丁2013年12月30日
状态
经核准的