A236807 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 62nd year, we have over 390,000 sequences, and we’ve reached 12,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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.

75907, 2926867, 107087939, 5140896385, 203606804707, 11092792124317, 457619414560859, 27133853757874765, 1137649333616978947, 71445848806556028277, 3006262303583356155659, 196820730933791596981165

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Column 6 of A236809

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

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)

EXAMPLE

Some solutions for n=1

..0..1..2..2..1..0..2....1..0..2..2..0..1..1....1..2..0..0..0..0..0

..0..2..2..1..1..1..0....0..2..1..0..1..1..2....2..0..1..0..1..2..1

CROSSREFS

Sequence in context: A323804 A135209 A243959 * A251470 A091294 A096518

Adjacent sequences: A236804 A236805 A236806 * A236808 A236809 A236810

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 31 2014

STATUS

approved