|
|
A266825
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west, northwest or southwest neighbor modulo n and the upper left element equal to 0.
|
|
6
|
|
|
1, 1, 0, 1, 0, 1, 1, 0, 0, 2, 1, 0, 1, 1, 9, 1, 0, 4, 16, 86, 44, 1, 0, 10, 133, 3335, 4701, 265, 1, 0, 25, 1236, 242563, 2320408, 378116, 1854, 1, 0, 45, 15125, 34126530, 1900782587, 2535597415, 41728537, 14833, 1, 0, 120, 214140, 5123428157, 1909319290122
(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..........0.............1..............4............10.........25
......2..........1............16............133..........1236......15125
......9.........86..........3335.........242563......34126530.5123428157
.....44.......4701.......2320408.....1900782587.1909319290122
....265.....378116....2535597415.26186341952354
...1854...41728537.4417318594838
..14833.5954780104
.133496
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..3..2..1....0..2..1..1....0..2..1..3....0..3..3..1....0..0..3..1
..0..3..2..1....3..2..1..0....0..2..1..3....0..3..2..1....0..3..2..1
..0..3..2..1....2..1..0..3....0..2..1..3....0..2..2..1....0..3..2..1
..0..3..2..1....2..0..3..3....0..2..1..3....3..2..1..0....3..2..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|