|
|
A266681
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its northwest or northeast neighbor modulo n and the upper left element equal to 0.
|
|
3
|
|
|
1, 1, 1, 1, 1, 2, 1, 1, 5, 6, 1, 1, 15, 101, 24, 1, 1, 59, 2520, 3417, 120, 1, 1, 257, 77830, 781497, 184881, 720, 1, 1, 1205, 2643025, 235204800, 508436767, 14216101, 5040, 1, 1, 5879, 96489721, 81044162960, 1916370808311, 559048727531, 1477674733, 40320
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
Table starts
.....1..........1............1.............1...........1........1..........1
.....1..........1............1.............1...........1........1..........1
.....2..........5...........15............59.........257.....1205.......5879
.....6........101.........2520.........77830.....2643025.96489721.3689693411
....24.......3417.......781497.....235204800.81044162960
...120.....184881....508436767.1916370808311
...720...14216101.559048727531
..5040.1477674733
.40320
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..2..1..3....0..2..0..1....0..0..0..1....0..3..0..2....0..3..2..2
..0..3..2..3....1..3..0..2....3..3..0..2....2..3..1..2....1..2..1..0
..1..2..1..0....2..3..2..0....3..3..1..2....3..0..1..1....1..0..2..3
..0..3..2..1....3..1..3..1....2..1..2..1....2..3..0..1....3..0..3..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|