|
|
A266904
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west or southwest neighbor modulo n and the upper left element equal to 0.
|
|
6
|
|
|
1, 1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 5, 13, 9, 1, 0, 11, 102, 331, 44, 1, 0, 24, 1233, 31550, 17651, 265, 1, 0, 77, 17773, 4320344, 19336609, 1386377, 1854, 1, 0, 222, 295717, 697988671, 29135818243, 21048933326, 148410280, 14833, 1, 0, 700, 5288444
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,10
|
|
COMMENTS
|
Table starts
......1...........1..............1...............1..............1............1
......0...........0..............0...............0..............0............0
......1...........1..............5..............11.............24...........77
......2..........13............102............1233..........17773.......295717
......9.........331..........31550.........4320344......697988671.118566001021
.....44.......17651.......19336609.....29135818243.51215246659276
....265.....1386377....21048933326.456207481947741
...1854...148410280.36737059793206
..14833.20588092054
.133496
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..0..3..2....0..2..2..1....0..2..1..3....0..2..1..3....0..2..0..2
..2..0..2..0....0..0..2..1....3..1..3..1....2..1..3..1....2..0..3..2
..1..3..1..3....0..3..1..3....2..0..3..1....1..3..2..0....1..3..3..1
..3..2..1..1....3..1..3..2....2..0..2..0....0..2..0..3....1..3..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|