|
%I #5 Mar 01 2015 11:48:49
%S 968,3692,14192,54560,209412,803246,3083292,11835664,45429680,
%T 174365744,669261344,2568836929,9859943512,37845226102,145260624176,
%U 557551963747,2140043779888,8214097736920,31528047115872,121013635650740
%N Number of length n+4 0..3 arrays with at most two downsteps in every 4 consecutive neighbor pairs
%C Column 4 of A255660
%H R. H. Hardin, <a href="/A255656/b255656.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 4*a(n-1) -4*a(n-3) +15*a(n-4) -24*a(n-5) -68*a(n-6) +136*a(n-7) -81*a(n-8) +40*a(n-9) -10*a(n-10) +4*a(n-11) -a(n-12)
%e Some solutions for n=4
%e ..3....2....1....1....2....0....2....1....0....3....3....1....1....3....2....2
%e ..0....1....3....2....1....3....2....3....2....0....1....3....0....0....2....1
%e ..1....2....0....2....3....1....1....3....0....0....1....3....1....0....0....1
%e ..1....2....2....1....3....1....3....1....1....1....2....1....1....0....1....3
%e ..2....0....3....3....0....1....0....1....3....1....3....2....2....0....3....0
%e ..2....3....1....3....2....2....3....1....3....1....3....1....2....1....1....0
%e ..0....3....1....2....1....1....3....2....3....0....1....2....2....2....0....3
%e ..0....1....2....0....3....1....0....3....0....0....1....1....1....3....1....2
%Y Cf. A255660
%K nonn
%O 1,1
%A _R. H. Hardin_, Mar 01 2015
| 