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

A267403
Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any north, west or northwest neighbors modulo n and the upper left element equal to 0.
0
1, 126, 64, 220, 795, 2814, 9469, 30728, 95802, 284725, 817017, 2266402
OFFSET
1,2
COMMENTS
Superdiagonal 3 of A267401.
EXAMPLE
Some solutions for n=4
..0..1..2..2..3..3..3....0..1..2..2..3..0..0....0..1..1..2..3..0..0
..1..1..2..2..3..0..0....1..1..2..3..3..0..1....1..1..2..2..3..0..0
..1..1..2..3..3..0..0....1..2..2..3..3..0..1....1..2..2..3..3..0..1
..1..2..2..3..0..0..1....2..2..3..3..0..0..1....2..2..3..3..3..0..1
CROSSREFS
Cf. A267401.
Sequence in context: A331401 A267199 A348898 * A267342 A278935 A267395
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 13 2016
STATUS
approved