%I #4 May 10 2014 18:47:20
%S 140,440,1300,3648,10012,27368,75236,208976,577964,1596216,4408020,
%T 12176768,33645500,92967176,256849892,709617776,1960543660,5416680632,
%U 14965468916,41347189280,114235439996,315613828040,871989852740
%N Number of length n+4+2 0..4 arrays with every value 0..4 appearing at least once in every consecutive 4+3 elements, and new values 0..4 introduced in order
%C Column 4 of A242322
%H R. H. Hardin, <a href="/A242319/b242319.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-1) +2*a(n-2) +4*a(n-3) +6*a(n-4) +10*a(n-5) +12*a(n-6) -4*a(n-7) -6*a(n-8) -6*a(n-9) -2*a(n-11) -2*a(n-12) +a(n-14) +a(n-15)
%e Some solutions for n=5
%e ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e ..1....1....1....1....1....1....1....0....1....1....1....0....0....1....1....1
%e ..0....2....2....2....0....0....1....1....2....2....2....1....1....0....2....2
%e ..2....1....2....3....2....2....2....2....3....2....0....2....2....2....0....0
%e ..3....3....3....3....3....3....3....2....1....3....3....1....0....3....3....3
%e ..2....0....4....0....4....0....4....3....4....4....4....3....3....2....4....1
%e ..4....4....1....4....0....4....0....4....0....1....1....4....4....4....1....4
%e ..3....1....0....2....0....1....2....0....3....0....0....2....1....1....2....0
%e ..1....2....2....1....1....2....1....1....2....1....2....0....2....0....0....0
%e ..0....2....0....4....2....0....2....2....1....2....3....4....2....0....1....2
%e ..3....1....4....4....0....3....4....3....1....4....0....1....4....4....4....3
%K nonn
%O 1,1
%A _R. H. Hardin_, May 10 2014