This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A191316 #23 Jul 17 2017 02:18:24
%S A191316 1,1,2,3,5,1,8,2,14,5,1,23,10,2,40,23,6,1,67,44,13,2,117,92,35,7,1,
%T A191316 198,174,72,16,2,346,350,170,49,8,1,590,654,345,106,19,2,1032,1280,
%U A191316 768,277,65,9,1,1769,2374,1530,592,146,22,2,3096,4564,3263,1436,417,83,10,1,5328,8414,6417,3004,928,192,25,2
%N A191316 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n having k UDU's, where U = (1,1) and D = (1,-1).
%C A191316 A dispersed Dyck paths of length n is a Motzkin path of length n with no (1,0) steps at positive heights.
%C A191316 Row n>=2 has floor(n/2) entries (n>=2).
%C A191316 Sum of entries in row n is binomial(n, floor(n/2)) = A001405(n).
%C A191316 Sum_{k>=0} k*T(n,k) = A107373(n-1).
%C A191316 Addendum Jun 18 2011: (Start)
%C A191316 T(n,k) is also the number of length n left factors of Dyck paths having k DUD's.
%C A191316 T(n,k) is also the number of dispersed Dyck paths of length n having k DUD's. Example: T(7,2)=2 because we have HU(DU[D)UD] and U(DU[D)UD]H, where H = (1,0) (the DUD's are shown between parentheses). (End)
%F A191316 G.f.: G=G(t,z) is given by z*(1-2*z+z^2-z^3-t*z^2+t*z^3)*G^2 +(1-2*z)*(1+z^2-t*z^2)*G -(1+z^2-t*z^2)=0.
%F A191316 This can also be written as G = C/(1-z*C), where C=C(t,z) is given by z^2*C^2 - (1 + z^2 - t*z^2)*C + 1 + z^2 - t*z^2 = 0. - _Emeric Deutsch_, Jun 18 2011
%F A191316 T(n,0) = A191317(n).
%e A191316 T(7,2)=2 because we have H(UD[U)DU]D and (UD[U)DU]DH, where U=(1,1), D=(1,-1), H=(1,0) (the UDU's are shown between parentheses).
%e A191316 T(7,2)=2 because we have U(DU[D)UD]U and UU(DU[D)UD], where U=(1,1) and D=(1,-1) (the DUD's are shown between parentheses).
%e A191316 Triangle starts:
%e A191316 1;
%e A191316 1;
%e A191316 2;
%e A191316 3;
%e A191316 5, 1;
%e A191316 8, 2;
%e A191316 14, 5, 1;
%e A191316 23, 10, 2;
%e A191316 40, 23, 6, 1;
%p A191316 eq := z*(1-2*z+z^2-z^3-t*z^2+t*z^3)*G^2+(1-2*z)*(1+z^2-t*z^2)*G-1-z^2+t*z^2 = 0: G := RootOf(eq, G): Gser := simplify(series(G, z = 0, 20)): for n from 0 to 17 do P[n] := sort(coeff(Gser, z, n)) end do: 1; 1; for n from 2 to 17 do seq(coeff(P[n], t, k), k = 0 .. floor((1/2)*n)-1) end do; # yields sequence in triangular form
%p A191316 # alternative, added Jun 18 2011:
%p A191316 eq := z^2*C^2-(1+z^2-t*z^2)*C+1+z^2-t*z^2: C := RootOf(eq, C): G := C/(1-z*C): Gser := simplify(series(G, z = 0, 20)): for n from 0 to 17 do P[n] := sort(coeff(Gser, z, n)) end do: 1 1; for n from 2 to 17 do seq(coeff(P[n], t, k), k = 0 .. floor((1/2)*n)-1) end do;
%Y A191316 Cf. A001405, A107373, A191317.
%K A191316 nonn,tabf
%O A191316 0,3
%A A191316 _Emeric Deutsch_, Jun 01 2011