|
%I #4 Feb 28 2015 11:35:31
%S 651,1803,5088,14381,40659,114546,322078,907110,2556858,7205734,
%T 20304363,57202476,161153983,454067388,1279391559,3604760378,
%U 10156531428,28616171577,80626959391,227170254438,640061685474,1803397934760
%N Number of length n+5 0..2 arrays with at most two downsteps in every 5 consecutive neighbor pairs
%C Column 5 of A255622
%H R. H. Hardin, <a href="/A255619/b255619.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) -3*a(n-2) +8*a(n-3) -9*a(n-4) +30*a(n-5) -35*a(n-6) +12*a(n-7) -45*a(n-8) +56*a(n-9) -147*a(n-10) +177*a(n-11) -63*a(n-12) +18*a(n-13) +3*a(n-14)
%e Some solutions for n=4
%e ..1....0....2....1....1....2....0....0....0....2....1....0....2....0....0....2
%e ..0....2....0....1....2....1....0....2....1....0....1....1....2....2....0....2
%e ..0....0....1....2....0....2....1....0....1....1....0....1....0....1....1....1
%e ..2....1....2....2....1....0....1....0....1....2....2....2....2....1....1....2
%e ..1....2....1....2....0....1....1....1....2....1....2....2....1....1....1....2
%e ..2....2....2....0....0....1....2....0....0....2....0....2....2....2....0....1
%e ..0....0....0....0....0....0....1....2....0....0....0....0....2....2....0....1
%e ..1....0....0....2....1....2....1....2....2....0....1....0....2....0....0....0
%e ..2....0....0....2....1....0....1....2....0....1....0....0....2....1....1....1
%Y Cf. A255622
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 28 2015
| 