Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Dec 20 2014 23:03:40
%S 1,1,1,1,1,1,1,1,1,1,1,2,4,7,11,16,22,29,37,46,56,68,85,112,156,226,
%T 333,490,712,1016,1421,1949,2630,3512,4676,6256,8464,11620,16187,
%U 22811,32366,46005,65225,91967,128786,179140,247861,341885,471332,651041,902679
%N Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 10).
%H Alois P. Heinz, <a href="/A212369/b212369.txt">Table of n, a(n) for n = 0..1000</a>
%F G.f. satisfies: A(x) = 1+A(x)*(x-x^10*(1-A(x))).
%F a(n) = a(n-1) + Sum_{k=1..n-10} a(k)*a(n-10-k) if n>0; a(0) = 1.
%e a(0) = 1: the empty path.
%e a(1) = 1: UD.
%e a(11) = 2: UDUDUDUDUDUDUDUDUDUDUD, UUUUUUUUUUUDDDDDDDDDDD.
%e a(12) = 4: UDUDUDUDUDUDUDUDUDUDUDUD, UDUUUUUUUUUUUDDDDDDDDDDD, UUUUUUUUUUUDDDDDDDDDDDUD, UUUUUUUUUUUDUDDDDDDDDDDD.
%p a:= proc(n) option remember;
%p `if`(n=0, 1, a(n-1) +add(a(k)*a(n-10-k), k=1..n-10))
%p end:
%p seq(a(n), n=0..60);
%p # second Maple program:
%p a:= n-> coeff(series(RootOf(A=1+A*(x-x^10*(1-A)), A), x, n+1), x, n):
%p seq(a(n), n=0..60);
%t With[{k = 10}, CoefficientList[Series[(1 - x + x^k - Sqrt[(1 - x + x^k)^2 - 4*x^k]) / (2*x^k), {x, 0, 50}], x]] (* _Vaclav Kotesovec_, Sep 02 2014 *)
%Y Column k=10 of A212363.
%K nonn
%O 0,12
%A _Alois P. Heinz_, May 10 2012