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!)
A253659 Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock diagonal maximum minus antidiagonal maximum unequal to its neighbors horizontally, vertically and nw-se diagonally. 1

%I #6 Apr 22 2021 15:43:57

%S 157476,1284808,17719343,213776286,2673402320,32368598122,

%T 395496194486,4770936979106,57860771981049,697085769177592,

%U 8412051248192626,101280686973886820,1219331259876825415,14660463628686907812

%N Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock diagonal maximum minus antidiagonal maximum unequal to its neighbors horizontally, vertically and nw-se diagonally.

%C Column 5 of A253662.

%H R. H. Hardin, <a href="/A253659/b253659.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=1

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

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

%Y Cf. A253662.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 07 2015

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)