This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267556 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 north or northeast neighbors modulo n and the upper left element equal to 0. 0
 1, 126, 410, 2437, 21835, 326500, 7589059, 271504873 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Superdiagonal 3 of A267553. LINKS EXAMPLE Some solutions for n=4 ..0..3..0..0..1..2..2....0..3..0..1..0..1..2....0..0..1..1..2..3..2 ..0..0..1..1..2..2..2....0..0..1..1..1..2..2....0..1..1..2..3..3..3 ..0..1..1..2..3..3..3....0..1..2..2..2..3..3....1..2..2..3..3..0..0 ..1..1..2..3..0..3..3....1..2..3..3..3..0..3....2..2..3..0..0..1..1 CROSSREFS Cf. A267553. Sequence in context: A322542 A323759 A102805 * A268119 A202406 A202399 Adjacent sequences:  A267553 A267554 A267555 * A267557 A267558 A267559 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 22 00:52 EDT 2019. Contains 328315 sequences. (Running on oeis4.)