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”).

A267018
Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any northeast or northwest neighbors modulo n and the upper left element equal to 0.
1
1, 3, 15, 137, 2063, 69265, 4893787, 787556232
OFFSET
1,2
COMMENTS
Diagonal of A267019.
EXAMPLE
Some solutions for n=4
..0..3..1..3....0..1..3..2....0..2..0..1....0..3..1..2....0..2..0..3
..3..1..0..2....1..0..2..3....2..0..2..1....3..1..3..1....2..1..3..1
..2..0..2..0....1..2..0..3....0..3..1..3....2..0..1..3....1..3..1..0
..1..3..1..2....2..1..3..0....3..1..3..2....0..2..0..2....3..2..0..2
CROSSREFS
Cf. A267020.
Sequence in context: A195764 A113723 A113379 * A262911 A163949 A005816
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 09 2016
STATUS
approved