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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Dec 03 2014 16:47:26
%S 3250,170038,8888108,464687066,24294592462,1270162626436,
%T 66406260528122,3471832190942254,181513288991552436,
%U 9489823318679339926,496144095673713305306,25939256760196067292272,1356148439815055707788150
%N Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock summing to 3 4 5 6 7 8 or 9
%C Column 2 of A251507
%H R. H. Hardin, <a href="/A251501/b251501.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 51*a(n-1) +98*a(n-2) -1591*a(n-3) -1723*a(n-4) +10123*a(n-5) +2357*a(n-6) -17329*a(n-7) +4004*a(n-8) +5484*a(n-9) -1920*a(n-10)
%e Some solutions for n=2
%e ..2..1..1....1..0..0....0..2..2....1..0..3....2..2..0....1..0..0....3..2..0
%e ..3..2..2....2..2..2....2..1..1....2..3..0....1..3..0....2..2..1....0..2..2
%e ..0..3..0....0..0..3....0..0..2....1..3..3....0..1..2....2..1..0....1..3..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 03 2014