|
|
A267617
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or antidiagonal neighbor and the top left element equal to 0.
|
|
5
|
|
|
0, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 4, 8, 6, 0, 1, 12, 42, 48, 24, 0, 1, 34, 576, 906, 384, 120, 0, 1, 112, 5492, 59328, 33120, 3840, 720, 0, 1, 340, 68958, 2192682, 10213152, 1839720, 46080, 5040, 0, 1, 1073, 814418, 131218206, 1721696832, 2641529760, 144491760
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
Table starts
.0.....1......1.........1..........1..........1.........1..........1.......1
.0.....1......2.........4.........12.........34.......112........340....1073
.0.....2......8........42........576.......5492.....68958.....814418.9982880
.0.....6.....48.......906......59328....2192682.131218206.6966218352
.0....24....384.....33120...10213152.1721696832
.0...120...3840...1839720.2641529760
.0...720..46080.144491760
.0..5040.645120
.0.40320
.0
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..0..2..2....0..0..1..1....0..0..0..0....0..0..0..0....0..0..0..3
..0..0..3..3....0..0..1..1....2..2..2..3....2..2..3..3....0..3..3..2
..2..2..1..1....3..3..3..3....2..3..3..3....1..1..1..1....3..1..2..2
..1..1..3..3....2..2..2..2....1..1..1..1....2..2..3..3....1..2..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|