This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268117 Number of nX(n+1) arrays of permutations of n+1 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, 10, 30, 182, 1687, 24745, 586844, 22971957, 1520467020 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Superdiagonal 1 of A268115. LINKS EXAMPLE Some solutions for n=6 ..0..0..1..2..3..4..4....0..0..1..1..2..3..4....0..1..2..2..3..4..5 ..0..1..2..3..3..4..5....0..1..1..2..3..4..5....1..2..3..3..4..5..0 ..1..2..2..3..4..5..0....1..1..2..3..4..5..5....2..3..3..4..5..0..1 ..1..2..3..4..5..5..0....2..2..2..3..4..5..0....3..4..4..5..0..0..1 ..1..2..3..4..5..5..0....2..3..3..4..5..5..0....4..4..5..0..1..1..2 ..1..2..3..4..5..0..1....3..4..4..5..0..0..1....5..5..0..1..2..2..3 CROSSREFS Cf. A268115. Sequence in context: A301664 A259136 A098684 * A256879 A064012 A276180 Adjacent sequences:  A268114 A268115 A268116 * A268118 A268119 A268120 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 October 15 01:40 EDT 2019. Contains 328025 sequences. (Running on oeis4.)