%I #4 Feb 14 2015 13:12:19
%S 927,1616,3042,6141,12662,25578,49611,91887,166290,303969,573853,
%T 1118256,2210103,4340001,8343339,15695433,29216435,54612816,103548108,
%U 199304393,386593848,747736983,1432037309,2714684340,5119381929,9669662693
%N Number of length n+7 0..2 arrays with at most one downstep in every 7 consecutive neighbor pairs
%C Column 7 of A255107
%H R. H. Hardin, <a href="/A255106/b255106.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n1) 3*a(n2) +a(n3) +33*a(n7) 57*a(n8) +25*a(n9) 15*a(n14) +10*a(n15)
%e Some solutions for n=4
%e ..0....2....1....0....0....2....1....0....0....0....0....0....1....1....0....0
%e ..1....2....1....0....2....2....1....1....0....1....1....1....0....2....0....0
%e ..1....1....1....0....0....1....1....2....0....0....2....2....0....2....1....0
%e ..1....2....0....1....0....1....1....0....0....0....2....0....1....2....1....0
%e ..2....2....1....1....1....1....1....0....0....0....0....0....1....2....0....1
%e ..2....2....1....1....1....1....2....0....1....1....0....0....1....2....0....1
%e ..2....2....1....1....2....1....0....0....1....1....0....0....1....0....0....2
%e ..1....2....2....1....2....1....1....0....1....2....0....0....1....2....0....2
%e ..1....2....2....1....2....1....1....0....0....2....1....1....2....2....0....2
%e ..1....2....2....1....2....2....1....0....2....1....2....2....0....2....1....2
%e ..2....0....0....1....0....0....2....1....2....2....2....1....2....2....1....1
%Y Cf. A255107
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 14 2015
