|
|
A267072
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its west or southwest neighbor modulo n and the upper left element equal to 0.
|
|
6
|
|
|
1, 1, 1, 1, 0, 2, 1, 0, 2, 6, 1, 0, 6, 44, 24, 1, 0, 31, 1129, 1949, 120, 1, 0, 141, 30637, 437427, 119544, 720, 1, 0, 550, 775567, 109852687, 310439601, 9966710, 5040, 1, 0, 2046, 21970109, 31745527110, 1011979038956, 368078731163, 1094087602, 40320, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
Table starts
...1.......1............1.................1................1..............1
...1.......0............0.................0................0..............0
...2.......2............6................31..............141............550
...6......44.........1129.............30637...........775567.......21970109
..24....1949.......437427.........109852687......31745527110.10164842993183
.120..119544....310439601.....1011979038956.3899321211077068
.720.9966710.368078731163.18398910840846332
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..0..2..2....0..2..1..0....0..2..0..0....0..3..3..1....0..0..3..2
..1..3..3..1....3..3..1..1....3..1..1..1....3..1..1..0....1..3..3..2
..1..3..2..2....3..2..1..0....3..3..1..0....2..2..0..0....1..1..3..1
..0..0..3..1....0..3..2..2....3..2..2..2....3..2..2..1....2..0..2..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|