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!)
A253399 Number of (n+1) X (n+1) 0..2 arrays with every 2 X 2 subblock diagonal maximum plus antidiagonal minimum unequal to its neighbors horizontally, vertically and ne+sw antidiagonally. 1

%I #7 Dec 31 2023 17:38:34

%S 81,2192,27362,403698,7257328,196170260,4643086490,176392793534,

%T 7735283529732,473507980691236,33662526487544248,4000330502181468930,

%U 385260385567127025928,74373894362155945768362

%N Number of (n+1) X (n+1) 0..2 arrays with every 2 X 2 subblock diagonal maximum plus antidiagonal minimum unequal to its neighbors horizontally, vertically and ne+sw antidiagonally.

%C Diagonal of A253407.

%H R. H. Hardin, <a href="/A253399/b253399.txt">Table of n, a(n) for n = 1..15</a>

%e Some solutions for n=3

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

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

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

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

%Y Cf. A253407.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 31 2014

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)