|
|
A266632
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west, southeast or southwest neighbor modulo n and the upper left element equal to 0.
|
|
5
|
|
|
1, 1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 13, 9, 1, 0, 1, 64, 139, 44, 1, 0, 1, 438, 6342, 7623, 265, 1, 0, 1, 3265, 388863, 3030929, 585112, 1854, 1, 0, 1, 27626, 27063372, 1772907246, 3232725244, 60695930, 14833, 1, 0, 1, 266481, 2069073259, 1296240915530
(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.............1..............1.............1..........1
......2.........13............64............438..........3265......27626
......9........139..........6342.........388863......27063372.2069073259
.....44.......7623.......3030929.....1772907246.1296240915530
....265.....585112....3232725244.27352023568047
...1854...60695930.5451050692400
..14833.8247622671
.133496
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..2..1..3....0..2..0..2....0..2..1..0....0..2..1..0....0..3..1..1
..2..1..3..1....3..1..3..2....0..2..0..2....3..2..0..2....3..1..3..1
..1..3..2..0....2..0..3..1....3..1..3..2....3..1..3..2....2..0..2..0
..3..2..0..0....0..3..1..1....1..3..3..1....1..0..3..1....0..3..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|