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

%I #4 Feb 06 2014 06:32:25

%S 82800,1279474,19874388,342809906,5467718444,88161950500,

%T 1426506722524,24924114752042,399514227564720,6485003092055912,

%U 105604722270477376,1869515793878816134,30082238553871757044,491248578646070624902

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

%C Column 6 of A237332

%H R. H. Hardin, <a href="/A237330/b237330.txt">Table of n, a(n) for n = 1..50</a>

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 06 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 18 03:29 EDT 2024. Contains 371767 sequences. (Running on oeis4.)