A217952 - OEIS

%I #4 Oct 15 2012 16:00:08

%S 4,16,50,130,296,610,1163,2097,3670,6434,11666,22313,44907,93206,

%T 194831,403141,818641,1628770,3184993,6157786,11854873,22877202,

%U 44459405,87168326,172249773,342083954,680463827,1351826291,2677343192,5283369867

%N Number of n element 0..3 arrays with each element the minimum of 6 adjacent elements of a random 0..3 array of n+5 elements

%C Column 6 of A217954

%H R. H. Hardin, <a href="/A217952/b217952.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 4*a(n-1) -6*a(n-2) +4*a(n-3) -a(n-4) +6*a(n-7) -4*a(n-8) +6*a(n-9) +4*a(n-10) +5*a(n-11) +6*a(n-12) +7*a(n-13) +3*a(n-14) +5*a(n-15) +4*a(n-16) +3*a(n-17) +2*a(n-18) +a(n-19)

%e Some solutions for n=4

%e ..0....0....1....1....0....3....1....0....0....2....0....2....2....1....2....3

%e ..3....0....2....3....1....3....2....1....0....2....2....2....3....2....2....2

%e ..3....3....3....3....3....2....3....1....1....1....1....2....0....2....3....1

%e ..3....2....1....0....3....2....2....0....2....0....0....2....0....1....3....1

%K nonn

%O 1,1

%A _R. H. Hardin_ Oct 15 2012