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!)
A267283 Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0. 0

%I

%S 1,462,13767,741057,79348962,13687472182

%N Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

%C Superdiagonal 4 of A267278.

%e Some solutions for n=3

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

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

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

%Y Cf. A267278.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 12 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 May 20 08:03 EDT 2022. Contains 353852 sequences. (Running on oeis4.)