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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267567 Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-1 with every element equal to or 1 greater than any west or southwest neighbors modulo n and the upper left element equal to 0. 0
 1, 462, 2046, 60954, 4032703, 463755018, 86034010064 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Superdiagonal 4 of A267562. LINKS EXAMPLE Some solutions for n=4 ..0..0..1..2..3..3..3..0....0..0..1..1..2..2..3..0....0..1..2..2..2..2..3..3 ..0..1..1..2..2..2..3..0....0..1..1..1..2..3..3..3....0..1..1..1..2..2..3..0 ..1..1..1..1..2..3..3..3....0..0..1..1..2..2..3..3....0..1..1..1..2..3..3..0 ..0..0..0..1..2..2..2..3....3..0..1..2..2..2..3..0....0..0..0..1..2..3..3..3 CROSSREFS Cf. A267562. Sequence in context: A246476 A202642 A158627 * A267557 A154056 A236350 Adjacent sequences:  A267564 A267565 A267566 * A267568 A267569 A267570 KEYWORD nonn AUTHOR R. H. Hardin, Jan 17 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 June 27 22:08 EDT 2022. Contains 354898 sequences. (Running on oeis4.)