%I #7 Mar 31 2012 12:37:31
%S 614,12725,254314,5115121,102841182,2068413037,41604910322,
%T 836912242697,16835567508454,338674538233541,6813037960821306,
%U 137056899213689121,2757159785015774318,55465567148672270109,1115797113738320026498
%N Number of (n+1)X5 0..2 arrays with every 2X2 subblock having one or three distinct values, and new values 0..2 introduced in row major order
%C Column 4 of A210107
%H R. H. Hardin, <a href="/A210103/b210103.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 39*a(n-1) -424*a(n-2) -100*a(n-3) +25342*a(n-4) -98910*a(n-5) -353224*a(n-6) +2683456*a(n-7) -679949*a(n-8) -24899773*a(n-9) +39419608*a(n-10) +84219756*a(n-11) -230024712*a(n-12) -56603460*a(n-13) +492890768*a(n-14) -143861456*a(n-15) -452015392*a(n-16) +208017984*a(n-17) +175455296*a(n-18) -65216128*a(n-19) -32317440*a(n-20) +2433024*a(n-21) +925696*a(n-22)
%e Some solutions for n=4
%e ..0..0..0..1..2....0..1..2..2..0....0..1..1..1..2....0..0..1..2..0
%e ..2..1..2..0..1....0..2..0..1..2....1..2..0..2..0....1..2..2..0..1
%e ..1..0..0..1..2....2..1..1..2..0....1..0..1..2..1....2..0..1..2..2
%e ..2..2..1..2..0....0..2..0..1..2....1..2..2..0..2....2..1..2..0..1
%e ..1..0..1..0..1....0..1..2..0..0....0..1..0..1..1....2..0..0..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 17 2012