A266455 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0.

1, 1, 0, 1, 1, 1, 1, 0, 5, 2, 1, 3, 39, 101, 9, 1, 0, 357, 6152, 3417, 44, 1, 10, 3471, 442285, 2079765, 184881, 265, 1, 0, 35003, 34667512, 1548940233, 1362641028, 14216101, 1854, 1, 35, 362265, 2875874396, 1294905380013, 12959331192279, 1511484069811

Offset: 1

Author

R. H. Hardin, Dec 29 2015

Keywords

• nonn
• tabl

Comments

Table starts

.....1..........1.............1..............1.............1................1

.....0..........1.............0..............3.............0...............10

.....1..........5............39............357..........3471............35003

.....2........101..........6152.........442285......34667512.......2875874396

.....9.......3417.......2079765.....1548940233.1294905380013.1166706600769605

....44.....184881....1362641028.12959331192279

...265...14216101.1511484069811

..1854.1477674733

.14833

Examples

			Some solutions for n=3 k=4
..0..2..2..1....0..0..0..1....0..2..0..1....0..0..1..2....0..1..0..2
..2..1..1..0....2..2..0..1....0..1..2..1....2..2..1..1....2..1..2..1
..2..0..1..0....2..1..2..1....2..1..2..0....2..1..0..0....1..0..2..0
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..50

Crossrefs

Column 1 is A000166(n-1).

Row 2 is A138364(n-1).