This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268118 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 or west neighbors modulo n and the upper left element equal to 0. 0
 1, 35, 114, 1256, 23522, 726627, 36708187, 3039274773 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Superdiagonal 2 of A268115. LINKS EXAMPLE Some solutions for n=5 ..0..0..1..2..2..3..4....0..0..1..1..2..2..3....0..1..2..2..3..3..4 ..1..1..2..2..3..4..0....1..1..2..2..3..3..4....1..2..3..3..4..4..0 ..1..2..3..3..4..0..0....2..2..2..3..4..4..0....2..2..3..4..0..0..1 ..2..3..3..4..4..0..1....3..3..3..4..0..0..0....2..3..4..4..0..1..1 ..2..3..4..4..0..1..1....4..4..4..0..1..1..1....2..3..4..0..0..1..1 CROSSREFS Cf. A268115. Sequence in context: A156332 A110832 A251269 * A212888 A044286 A044667 Adjacent sequences:  A268115 A268116 A268117 * A268119 A268120 A268121 KEYWORD nonn AUTHOR R. H. Hardin, Jan 26 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 April 18 22:08 EDT 2019. Contains 322237 sequences. (Running on oeis4.)