|
| |
|
| A283282号 |
| T（n，k）=没有1的nXk 0..1阵列的数量等于其水平、垂直和反对角线邻居的两个以上。 |
|
8
|
|
|
|
2, 4, 4, 8, 15, 8, 16, 50, 50, 16, 32, 176, 287, 176, 32, 64, 614, 1725, 1725, 614, 64, 128, 2141, 10299, 18320, 10299, 2141, 128, 256, 7472, 61491, 191025, 191025, 61491, 7472, 256, 512, 26070, 367208, 1994338, 3455416, 1994338, 367208, 26070, 512, 1024
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
表格开始
...2.....4........8.........16...........32.............64...............128
...4....15.......50........176..........614...........2141..............7472
...8....50......287.......1725........10299..........61491............367208
..16...176.....1725......18320.......191025........1994338..........20834848
..32...614....10299.....191025......3455416.......62640737........1136604611
..64..2141....61491....1994338.....62640737.....1974531630.......62300912853
.128..7472...367208...20834848...1136604611....62300912853.....3418770498783
.256.26070..2192810..217606715..20614698223..1964591851309...187461194033545
.512.90964.13094522.2272854285.373922480489.61959879789835.10281169933978992
|
|
|
链接
|
|
|
|
公式
|
k列的经验值：
k=1:a（n）=2*a（n-1）
k=2:a（n）=3*a（n-1）+a（n-2
k=3:[顺序12]
k=4:[顺序19]
k=5:[订单69]
|
|
|
例子
|
n=4k=4的一些解
..0..0..1..1. .0..1..0..0. .0..1..0..1. .1..1..0..0. .0..0..1..0
..0..0..1..0. .1..0..1..0. .0..0..0..1. .0..1..0..1. .1..0..1..0
..0..0..0..1. .0..0..0..0. .1..0..0..1. .0..0..1..0. .0..0..1..0
..1..0..0..1. .1..0..1..0. .0..0..0..1. .1..1..0..1. .0..1..0..0
|
|
|
交叉参考
|
|
|
|
关键词
|
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
