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

%I #4 Jan 07 2015 15:13:17

%S 3550,25062,241548,2113406,17719343,152352910,1302707432,11094507660,

%T 94827318012,808751503976,6903022252385,58900473067302,

%U 502630468746850,4288654203577526,36596735470949736,312258842250198756

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

%C Column 3 of A253662

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

%e Some solutions for n=2

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

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

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

%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 21 04:54 EDT 2024. Contains 371850 sequences. (Running on oeis4.)