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!)
A267567 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 west or southwest neighbors modulo n and the upper left element equal to 0. 0

%I

%S 1,462,2046,60954,4032703,463755018,86034010064

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

%C Superdiagonal 4 of A267562.

%e Some solutions for n=4

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

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

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

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

%Y Cf. A267562.

%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 August 16 07:50 EDT 2022. Contains 356160 sequences. (Running on oeis4.)