|
%I #5 Mar 31 2012 12:35:54
%S 523,5323,53589,568635,5935955,63219545,666851127,7093125423,
%T 75083743089,797712241059,8455615332243,89775833375689,
%U 952151137025019,10105957184619287,107209289222627269,1137721555373998703
%N Number of (n+1)X4 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others
%C Column 3 of A183836
%H R. H. Hardin, <a href="/A183830/b183830.txt">Table of n, a(n) for n = 1..200</a>
%F Empirical: a(n)=13*a(n-1)+42*a(n-2)-942*a(n-3)+1259*a(n-4)+16804*a(n-5)-40879*a(n-6)-117777*a(n-7)+381433*a(n-8)+303856*a(n-9)-1519845*a(n-10)+56140*a(n-11)+2613108*a(n-12)-1083416*a(n-13)-1748449*a(n-14)+1024510*a(n-15)+314900*a(n-16)-213340*a(n-17)+10760*a(n-18)+1824*a(n-19)
%e Some solutions for 3X4
%e ..1..2..1..0....2..0..2..0....0..1..2..1....2..0..1..2....2..2..2..1
%e ..2..1..2..2....2..1..1..1....2..1..2..1....1..2..1..0....1..0..1..2
%e ..1..0..1..1....1..2..2..0....1..2..0..2....2..0..2..1....2..2..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 07 2011
| 