The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268114 Number of n X n arrays containing n 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

%I

%S 1,3,8,25,111,761,9204,194567,7088277,450354517

%N Number of n X n arrays containing n 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.

%C Diagonal of A268115.

%e Some solutions for n=6

%e ..0..1..2..3..4..5....0..0..1..1..2..2....0..1..1..2..2..2....0..1..2..2..3..4

%e ..0..1..2..3..4..5....1..1..2..2..3..3....1..1..2..3..3..3....1..1..2..3..4..5

%e ..1..2..3..4..5..0....2..2..3..3..4..4....1..2..3..4..4..4....2..2..3..4..5..0

%e ..2..3..4..5..0..1....3..3..4..4..5..5....2..3..4..5..5..5....3..3..4..5..0..1

%e ..2..3..4..5..0..1....4..4..5..5..0..0....3..4..5..5..0..0....3..4..5..5..0..1

%e ..2..3..4..5..0..1....5..5..0..0..1..1....4..5..0..0..0..1....4..5..0..0..1..2

%Y Cf. A268115.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 26 2016

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 December 1 22:12 EST 2021. Contains 349435 sequences. (Running on oeis4.)