login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237963 Number of (n+1)X(6+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I

%S 109200,2202258,41361664,940160466,22274482472,486414446352,

%T 10338290400328,229053390313292,5150265942352632,113407366099585756,

%U 2475070415432792292,54620781102180000284,1211641431311635281476

%N Number of (n+1)X(6+1) 0..2 arrays with the maximum 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 A237965

%H R. H. Hardin, <a href="/A237963/b237963.txt">Table of n, a(n) for n = 1..97</a>

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 16 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 18:53 EDT 2019. Contains 323481 sequences. (Running on oeis4.)