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

A267835
Number of nX5 arrays of permutations of 5 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, 126, 8013, 456052, 26266875, 1578668020, 100947966762, 6887295213088
OFFSET
1,2
COMMENTS
Column 5 of A267836.
EXAMPLE
Some solutions for n=3
..0..0..1..0..1....0..0..2..1..1....0..2..2..0..2....0..2..1..1..2
..0..1..1..1..2....1..2..2..1..2....2..0..0..0..1....0..1..2..2..2
..2..2..2..0..2....2..0..1..0..0....1..1..1..1..2....1..0..0..0..1
CROSSREFS
Cf. A267836.
Sequence in context: A285172 A208618 A352334 * A202652 A278624 A156931
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 21 2016
STATUS
approved