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

A267833
Number of nX3 arrays containing 3 copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0.
0
1, 10, 91, 924, 10924, 147340, 2247540, 38338680, 723997540, 15008679840, 339055348800
OFFSET
1,2
COMMENTS
Column 3 of A267836.
EXAMPLE
Some solutions for n=4
..0..0..3....0..3..1....0..0..1....0..1..2....0..2..3....0..0..1....0..3..1
..1..0..1....0..1..2....1..1..3....1..2..3....2..3..1....0..2..3....0..1..1
..1..2..2....1..2..2....2..3..2....2..3..0....0..2..0....2..3..1....2..2..2
..3..3..2....3..3..0....0..3..2....0..1..3....3..1..1....3..1..2....3..3..0
CROSSREFS
Cf. A267836.
Sequence in context: A343354 A338678 A347260 * A354380 A015467 A144783
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 21 2016
STATUS
approved