|
|
2008年2月 |
| T(n,k)=不含1的nXk 0..1数组的数量等于其水平、对角线和反对角线邻域的两个以上,只有两个元素除外。 |
|
12
|
|
|
0, 0, 0, 0, 0, 0, 0, 5, 1, 0, 0, 14, 60, 6, 0, 0, 113, 625, 745, 49, 0, 0, 564, 5432, 10910, 7298, 272, 0, 0, 2410, 43793, 169426, 174447, 62303, 1376, 0, 0, 10648, 336614, 2343698, 4588054, 2510456, 496884, 6620, 0, 0, 45070, 2456405, 30330979
(列表;桌子;图表;参考文献;听;历史;文本;内部格式)
|
|
|
抵消
|
1,8
|
|
评论
|
表格开始
.0…..0…..0…..0…..0…..0…..0…..0…..0
.0.....0........5.........14...........113.............564..............2410
.0.....1.......60........625..........5432...........43793............336614
.0.....6......745......10910........169426.........2343698..........30330979
.0....49.....7298.....174447.......4588054.......109281786........2393467823
.0...272....62303....2510456.....112397437......4572654404......169720104148
.0..1376...496884...33933330....2592339953....179632502674....11308125156356
.0..6620..3767599..439118692...57256730323...6737192690688...719819137224851
.0.30552.27544383.5498459845.1224525471560.244126676935480.44286142978155009
|
|
链接
|
|
|
配方奶粉
|
k列的经验值:
k=1:a(n)=a(n-1)
k=2:[顺序15]
k=3:[订单30]
k=4:[订单42]
第n行的经验值:
n=1:a(n)=a(n-1)
n=2:[订单15]
n=3:[订单33]
n=4:[订单69]
|
|
示例
|
n=4k=4的一些解
..0..1..1..1. .0..1..1..1. .1..0..0..0. .1..1..0..1. .0..1..1..0
..0..1..1..1. .1..1..0..0. .1..0..1..1. .0..1..1..1. .0..1..0..1
..0..0..0..0. .0..1..0..1. .0..1..0..0. .0..1..0..0. .0..1..1..1
..0..0..1..1. .1..0..0..0. .1..1..1..1. .1..1..1..0. .0..0..1..0
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|