%I #4 Mar 23 2014 07:05:27
%S 10,112,1182,12246,127454,1320102,13703468,142051652,1473731150,
%T 15282171258,158517866826,1643986061990,17051506678146,
%U 176848369394606,1834236131924494,19023918997995414,197310588661661646
%N Number of 3Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4
%C Row 3 of A239649
%H R. H. Hardin, <a href="/A239651/b239651.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 8*a(n-1) +73*a(n-2) -446*a(n-3) -1413*a(n-4) +8070*a(n-5) +12185*a(n-6) -63420*a(n-7) -49358*a(n-8) +220534*a(n-9) +39486*a(n-10) -241802*a(n-11) +244780*a(n-12) -89648*a(n-13) -386680*a(n-14) -228008*a(n-15) +129984*a(n-16) -457816*a(n-17) -1064416*a(n-18) -330768*a(n-19) +556128*a(n-20) -351872*a(n-21) +769280*a(n-22) +407552*a(n-23) -200704*a(n-24) +32768*a(n-25)
%e Some solutions for n=5
%e ..1..0..3..1..0....3..0..1..3..0....3..1..1..3..1....1..0..0..0..0
%e ..2..1..0..1..1....2..1..2..2..1....2..0..0..3..0....2..0..0..0..1
%e ..3..1..2..1..1....2..0..0..0..0....1..0..2..2..2....3..0..0..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Mar 23 2014
|