# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a236996
Showing 1-1 of 1

%I A236996 #4 Feb 02 2014 07:19:00
%S A236996 640000,30233088,1406076928,80675315712,4279521280000,219711187058688,
%T A236996 11244238474313728,700611776439386112,40435085627883520000,
%U A236996 2290196951375479308288,131119070760867387670528
%N A236996 Number of (n+1)X(7+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C A236996 Column 7 of A236997
%H A236996 R. H. Hardin, <a href="/A236996/b236996.txt">Table of n, a(n) for n = 1..210</a>
%F A236996 Empirical: a(n) = 140*a(n-1) -6176*a(n-2) +87040*a(n-3) +21476352*a(n-4) -3006689280*a(n-5) +132637949952*a(n-6) -1869301678080*a(n-7) -149335861886976*a(n-8) +20907020664176640*a(n-9) -922298283013963776*a(n-10) +12998193418642391040*a(n-11) +331760110214840320000*a(n-12) -46446415430077644800000*a(n-13) +2048950440686853816320000*a(n-14) -28876399993099701452800000*a(n-15)
%e A236996 Some solutions for n=1
%e A236996 ..0..0..2..0..0..0..0..2....0..0..1..1..0..1..2..0....0..0..0..1..0..0..2..2
%e A236996 ..1..2..2..1..1..2..0..1....0..2..0..0..0..1..1..1....0..2..1..2..2..2..1..1
%K A236996 nonn
%O A236996 1,1
%A A236996 _R. H. Hardin_, Feb 02 2014

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE