|
%I #5 Mar 31 2012 12:37:31
%S 657,29650,1318221,57786977,2488428258,105669469816,4440075543303,
%T 185097842285157,7670637569725292,316449276490619988,
%U 13010107213014172819,533466565156551030287,21829520926687529872322
%N Number of (n+1)X5 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order
%C Column 4 of A210095
%H R. H. Hardin, <a href="/A210091/b210091.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 92*a(n-1) -2759*a(n-2) +28247*a(n-3) -12894*a(n-4) -1142474*a(n-5) +3601421*a(n-6) +11970542*a(n-7) -56246539*a(n-8) -20466947*a(n-9) +259395248*a(n-10) -85275847*a(n-11) -451433420*a(n-12) +270874469*a(n-13) +310376692*a(n-14) -241516822*a(n-15) -72716144*a(n-16) +82685288*a(n-17) -2658056*a(n-18) -9212400*a(n-19) +1726736*a(n-20) +40928*a(n-21) -15360*a(n-22)
%e Some solutions for n=4
%e ..0..0..0..1..1....0..1..1..2..1....0..1..0..2..1....0..0..1..0..2
%e ..0..1..1..1..1....1..1..1..1..1....0..1..0..2..1....2..0..0..0..2
%e ..1..0..0..0..1....1..2..1..2..1....0..0..0..2..2....2..0..1..0..2
%e ..0..0..2..0..0....1..2..1..2..1....0..0..0..2..2....2..0..0..0..2
%e ..2..2..0..2..2....1..1..2..1..1....0..1..0..2..0....0..2..2..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 17 2012
| 