A266309 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its west neighbor modulo n and the upper left element equal to 0.
1, 1, 1, 1, 1, 2, 1, 1, 7, 6, 1, 1, 39, 171, 24, 1, 1, 265, 8190, 6666, 120, 1, 1, 1802, 442285, 3264584, 384360, 720, 1, 1, 12239, 25839438, 1935720551, 2357929910, 30900150, 5040, 1, 1, 84614, 1605405629, 1294905380013, 18647592370365, 2805027363620
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..0....0..0..2..1....0..0..2..2....0..2..2..1....0..0..0..2 ..1..1..1..1....1..1..0..2....1..1..0..2....1..0..0..2....2..2..1..1 ..2..2..2..2....1..0..2..2....1..0..2..1....0..2..1..1....2..1..1..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..66
Crossrefs
Column 1 is A000142(n-1).
Comments