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

A267832
Number of nX2 arrays containing 2 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, 3, 11, 54, 330, 2430, 20970, 207900, 2331000, 29189160, 404044200, 6129723600, 101181603600, 1805933329200, 34664949118800
OFFSET
1,2
COMMENTS
Column 2 of A267836.
EXAMPLE
Some solutions for n=4
..0..1....0..1....0..3....0..0....0..1....0..3....0..2....0..3....0..2....0..1
..2..3....2..2....3..1....1..2....1..3....3..2....2..3....0..1....2..3....2..3
..0..1....3..0....1..2....3..2....0..2....2..0....3..0....2..1....0..1....3..0
..2..3....1..3....2..0....3..1....2..3....1..1....1..1....2..3....1..3....1..2
CROSSREFS
Cf. A267836.
Sequence in context: A302760 A054700 A009280 * A095707 A259105 A242952
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 21 2016
STATUS
approved