|
|
A266599
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north or northeast neighbor modulo n and the upper left element equal to 0.
|
|
6
|
|
|
1, 1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 6, 38, 9, 1, 0, 20, 964, 1197, 44, 1, 0, 83, 30637, 289569, 64497, 265, 1, 0, 410, 1073367, 89795439, 188978578, 4975742, 1854, 1, 0, 2109, 39966856, 31745527110, 731926880418, 207181732018, 519665920, 14833, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
COMMENTS
|
Table starts
......1...........1...............1.................1................1
......0...........0...............0.................0................0
......1...........2...............6................20...............83
......2..........38.............964.............30637..........1073367
......9........1197..........289569..........89795439......31745527110
.....44.......64497.......188978578......731926880418.3306610502435596
....265.....4975742....207181732018.11959316434000351
...1854...519665920.357677449791820
..14833.70425165645
.133496
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..1..1..3....0..1..2..2....0..1..1..3....0..0..1..1....0..0..1..2
..0..1..3..2....3..1..0..0....3..3..3..2....3..3..0..3....0..3..1..0
..3..3..2..0....1..3..3..0....2..2..2..0....2..2..3..2....3..3..3..2
..1..2..2..0....3..1..2..2....1..1..0..0....1..1..2..0....1..2..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|