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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267198 Number of nX(n+2) arrays of permutations of n+2 copies of 0..n-1 with every element equal to or 1 greater than any north, southwest or northwest neighbors modulo n and the upper left element equal to 0. 0
 1, 35, 11, 23, 47, 92, 166, 285, 460, 717, 1068, 1554, 2187, 3026, 4082, 5436 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Superdiagonal 2 of A267197. LINKS EXAMPLE Some solutions for n=4 ..0..1..2..3..3..0....0..1..2..2..3..0....0..1..1..2..3..0....0..1..1..2..3..3 ..1..1..2..3..0..0....1..1..2..3..3..0....0..1..2..2..3..0....0..1..1..2..3..3 ..1..2..2..3..0..1....1..1..2..3..3..0....1..1..2..3..3..0....0..1..2..2..3..0 ..2..2..3..3..0..1....1..2..2..3..0..0....1..2..2..3..3..0....0..1..2..2..3..0 CROSSREFS Cf. A267197. Sequence in context: A277079 A248477 A051050 * A267140 A088830 A033355 Adjacent sequences:  A267195 A267196 A267197 * A267199 A267200 A267201 KEYWORD nonn AUTHOR R. H. Hardin, Jan 11 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 July 28 19:33 EDT 2021. Contains 346335 sequences. (Running on oeis4.)