|
|
A266861
|
|
T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with no element 1 greater than its north or southwest neighbor modulo n and the upper left element equal to 0.
|
|
6
|
|
|
1, 1, 0, 1, 0, 1, 1, 0, 4, 2, 1, 0, 17, 39, 9, 1, 0, 66, 999, 1281, 44, 1, 0, 324, 31501, 328701, 67240, 265, 1, 0, 1565, 1115170, 104767812, 200359723, 5126572, 1854, 1, 0, 7908, 41983402, 37478933496, 781538349425, 215846101578, 531096757, 14833, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
COMMENTS
|
Table starts
...1.......1............1.................1................1..............1
...0.......0............0.................0................0..............0
...1.......4...........17................66..............324...........1565
...2......39..........999.............31501..........1115170.......41983402
...9....1281.......328701.........104767812......37478933496.14445711101455
..44...67240....200359723......781538349425.3543965467781564
.265.5126572.215846101578.12529121512138533
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4, k=4
..0..0..2..3....0..1..3..1....0..2..0..3....0..3..0..1....0..2..0..2
..2..3..1..1....3..1..1..3....2..0..3..1....0..2..3..3....0..1..2..0
..1..2..3..1....2..3..0..2....2..0..2..3....0..1..1..2....3..3..1..3
..0..0..2..3....0..2..0..2....1..3..1..1....2..1..3..2....3..1..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|