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!)
A236807 Number of (n+1)X(6+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal 1

%I #4 Jan 31 2014 06:33:09

%S 75907,2926867,107087939,5140896385,203606804707,11092792124317,

%T 457619414560859,27133853757874765,1137649333616978947,

%U 71445848806556028277,3006262303583356155659,196820730933791596981165

%N Number of (n+1)X(6+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal

%C Column 6 of A236809

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

%F Empirical: a(n) = 66*a(n-1) +6693*a(n-2) -517398*a(n-3) -12402284*a(n-4) +1417737384*a(n-5) -1644793764*a(n-6) -1564727002056*a(n-7) +21216496783968*a(n-8) +527850835201152*a(n-9) -12351354216581376*a(n-10) +54620084393888256*a(n-11) -1596475030394880*a(n-12) -411721665197137920*a(n-13) +648256268849283072*a(n-14) +287629499666792448*a(n-15) -1191655214366588928*a(n-16) +626271353535725568*a(n-17)

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 31 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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)