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!)
A267279 Number of (n+1)Xn arrays containing n copies of 0..n+1-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,5,24,293,6240,315356,33284502

%N Number of (n+1)Xn arrays containing n copies of 0..n+1-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 Subdiagonal 1 of A267278.

%e Some solutions for n=4

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

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

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

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

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

%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 October 6 23:36 EDT 2022. Contains 357270 sequences. (Running on oeis4.)