The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267332 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 southwest or northwest neighbors modulo n and the upper left element equal to 0. 0
 1, 462, 537, 10533, 359300, 14897883, 613275874, 23049149898, 792214723962, 25374821691357 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Superdiagonal 4 of A267328. LINKS EXAMPLE Some solutions for n=4 ..0..0..0..1..2..2..2..3....0..1..1..2..2..2..3..0....0..1..1..1..2..2..3..0 ..0..0..0..1..1..2..2..3....0..1..1..2..2..3..3..0....0..0..1..2..2..3..3..3 ..3..0..1..1..2..2..3..3....0..1..1..2..3..3..0..0....0..1..1..2..2..2..3..0 ..3..0..1..1..1..2..3..3....1..1..2..2..3..3..3..0....0..0..1..1..2..3..3..3 CROSSREFS Cf. A267328. Sequence in context: A267343 A267396 A258962 * A104397 A108749 A267740 Adjacent sequences:  A267329 A267330 A267331 * A267333 A267334 A267335 KEYWORD nonn AUTHOR R. H. Hardin, Jan 13 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 22:22 EST 2021. Contains 349589 sequences. (Running on oeis4.)