login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267552 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 northeast neighbors modulo n and the upper left element equal to 0. 1

%I #8 Apr 14 2020 21:34:29

%S 1,3,6,15,55,279,2033,21772,345843,8152180,287657713

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

%C Diagonal of A267553.

%e Some solutions for n=4

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

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

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

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

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)