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

A266903
Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, west or southwest neighbor modulo n and the upper left element equal to 0.
0
1, 0, 5, 102, 31550, 19336609, 21048933326, 36737059793206, 95191585228772333
OFFSET
1,3
COMMENTS
Column 3 of A266904.
EXAMPLE
Some solutions for n=5
..0..3..1....0..0..0....0..0..4....0..4..3....0..2..4....0..0..4....0..4..1
..4..3..0....2..2..2....3..2..4....4..3..1....4..1..3....3..0..2....2..2..1
..3..2..4....4..4..1....3..1..4....1..1..0....2..1..3....2..2..1....2..1..0
..0..2..1....1..3..3....2..0..2....3..0..4....1..3..0....4..1..3....4..3..0
..4..2..1....4..1..3....1..3..1....2..2..2....0..2..4....4..1..3....4..3..3
CROSSREFS
Cf. A266904.
Sequence in context: A123626 A210900 A197799 * A052138 A308459 A142418
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 05 2016
STATUS
approved