login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A267546
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, west or southeast neighbor modulo n and the upper left element equal to 0.
4
1, 1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 27, 9, 1, 0, 1, 255, 555, 44, 1, 0, 1, 3527, 55971, 24981, 265, 1, 0, 1, 51759, 7122569, 27018228, 1825761, 1854, 1, 0, 1, 852932, 1036887990, 39459215132, 26810032261, 184975696, 14833, 1, 0, 1, 14954188, 164245452936
OFFSET
1,10
COMMENTS
Table starts
.....1.........1...........1...........1..........1............1........1.1.1.1
.....0.........0...........0...........0..........0............0........0.0.0
.....1.........1...........1...........1..........1............1........1.1
.....2........27.........255........3527......51759.......852932.14954188
.....9.......555.......55971.....7122569.1036887990.164245452936
....44.....24981....27018228.39459215132
...265...1825761.26810032261
..1854.184975696
.14833
EXAMPLE
Some solutions for n=4 k=4
..0..2..0..3....0..3..1..0....0..3..3..1....0..2..2..0....0..2..1..3
..2..0..3..2....0..2..1..3....2..2..1..0....0..2..0..3....3..1..0..3
..1..3..2..1....2..1..3..2....2..0..3..3....2..1..3..1....1..0..3..2
..1..1..0..3....0..3..2..1....1..0..2..1....1..3..1..3....0..2..2..1
CROSSREFS
Column 1 is A000166(n-1).
Sequence in context: A334159 A326474 A266886 * A228817 A110399 A193275
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin, Jan 16 2016
STATUS
approved