The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267282 Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0. 0
 1, 126, 2840, 104742, 5977624, 466131976 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Superdiagonal 3 of A267278. LINKS EXAMPLE Some solutions for n=4 ..0..0..1..1..2..2..3....0..1..0..2..1..3..3....0..1..2..2..2..3..0 ..3..0..0..1..1..3..3....0..0..2..1..2..2..0....0..1..1..2..3..3..0 ..0..3..1..0..2..2..3....3..1..0..2..2..3..3....0..1..1..2..3..3..0 ..2..1..0..2..1..3..2....1..3..1..1..2..3..0....1..1..2..2..3..3..0 CROSSREFS Cf. A267278. Sequence in context: A219005 A202398 A113857 * A008397 A329754 A202593 Adjacent sequences:  A267279 A267280 A267281 * A267283 A267284 A267285 KEYWORD nonn AUTHOR R. H. Hardin, Jan 12 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 27 13:56 EDT 2022. Contains 354097 sequences. (Running on oeis4.)