The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267555 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 northeast neighbors modulo n and the upper left element equal to 0. 0

%I

%S 1,35,83,350,2165,22189,345443,8164233,287561285

%N 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 northeast neighbors modulo n and the upper left element equal to 0.

%C Superdiagonal 2 of A267553.

%e Some solutions for n=4

%e ..0..0..1..1..2..3....0..3..3..2..1..1....0..1..2..1..2..3....0..3..3..0..1..2

%e ..1..1..1..2..3..3....0..3..3..2..1..1....1..2..2..2..3..0....0..0..0..1..2..2

%e ..2..2..2..3..0..0....0..0..3..2..1..1....2..3..3..3..0..1....1..1..1..2..3..3

%e ..3..2..3..0..0..1....0..0..3..2..2..2....3..0..0..0..1..1....2..1..2..3..0..3

%Y Cf. A267553.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 17 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 02:51 EST 2022. Contains 358406 sequences. (Running on oeis4.)