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

A267834
Number of nX4 arrays of permutations of 4 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, 35, 829, 19696, 499523, 13895954, 422626232, 14039428460, 507351298590
OFFSET
1,2
COMMENTS
Column 4 of A267836.
EXAMPLE
Some solutions for n=4
..0..1..2..3....0..1..2..2....0..3..2..1....0..2..1..1....0..3..1..2
..1..2..3..0....1..2..3..3....0..2..1..0....3..1..2..2....0..2..2..3
..2..0..1..2....2..3..0..1....3..1..0..3....2..3..3..3....2..3..0..1
..0..1..3..3....3..0..1..0....2..1..3..2....0..0..0..1....3..0..1..1
CROSSREFS
Cf. A267836.
Sequence in context: A249884 A223957 A109508 * A001724 A062194 A004372
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 21 2016
STATUS
approved