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!)
A237509 Number of (n+1)X(6+1) 0..2 arrays with the maximum plus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I #4 Feb 08 2014 10:47:22

%S 97700,1553960,25188644,519582770,10729163264,198237517632,

%T 3611534827808,70059004480444,1372749454760336,26024559034229214,

%U 489347313650570220,9371504780126738958,180471591395652224156,3441168553794813361486

%N Number of (n+1)X(6+1) 0..2 arrays with the maximum plus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one

%C Column 6 of A237511

%H R. H. Hardin, <a href="/A237509/b237509.txt">Table of n, a(n) for n = 1..57</a>

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 08 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 May 5 14:41 EDT 2024. Contains 372275 sequences. (Running on oeis4.)