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

A268114
Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0.
0
1, 3, 8, 25, 111, 761, 9204, 194567, 7088277, 450354517
OFFSET
1,2
COMMENTS
Diagonal of A268115.
EXAMPLE
Some solutions for n=6
..0..1..2..3..4..5....0..0..1..1..2..2....0..1..1..2..2..2....0..1..2..2..3..4
..0..1..2..3..4..5....1..1..2..2..3..3....1..1..2..3..3..3....1..1..2..3..4..5
..1..2..3..4..5..0....2..2..3..3..4..4....1..2..3..4..4..4....2..2..3..4..5..0
..2..3..4..5..0..1....3..3..4..4..5..5....2..3..4..5..5..5....3..3..4..5..0..1
..2..3..4..5..0..1....4..4..5..5..0..0....3..4..5..5..0..0....3..4..5..5..0..1
..2..3..4..5..0..1....5..5..0..0..1..1....4..5..0..0..0..1....4..5..0..0..1..2
CROSSREFS
Cf. A268115.
Sequence in context: A184325 A051403 A004205 * A097713 A009392 A130648
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 26 2016
STATUS
approved