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 A191395 #13 Jul 17 2017 02:23:39
%S A191395 1,1,1,1,1,2,1,3,2,1,4,5,2,5,9,4,3,6,14,12,8,9,20,25,8,13,14,27,44,28,
%T A191395 31,29,40,70,66,16,49,54,62,104,129,64,109,115,116,159,225,168,32,170,
%U A191395 212,217,250,363,360,144,371,430,445,444,581,681,416,64,581,772,854,820,938,1182,968,320
%N A191395 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., of Motzkin paths of length n with no (1,0)-steps at positive heights) for which the sum of the heights of its base pyramid is k. A base pyramid is a factor of the form U^j D^j (j>0), starting at the horizontal axis. Here U=(1,1) and D=(1,-1).
%C A191395 Row n has 1+ceiling(n/2) entries.
%C A191395 Sum of entries in row n is binomial(n, floor(n/2)) = A001405(n).
%C A191395 T(n,0) = A191393(n).
%C A191395 Sum_{k>=0} k*T(n,k) = A191397(n).
%F A191395 G.f.: G=G(t,z) satisfies G = 1+z*G+z^2*G*(c+t/(1-t*z^2)-1/(1-z^2)), where c = (1-sqrt(1-4*z^2))/(2*z^2) (the Catalan function with argument z^2).
%e A191395 T(4,2)=2 because we have UDUD and UUDD, where U=(1,1), D=(1,-1), H=(1,0).
%e A191395 Triangle starts:
%e A191395 1;
%e A191395 1;
%e A191395 1, 1;
%e A191395 1, 2;
%e A191395 1, 3, 2;
%e A191395 1, 4, 5;
%e A191395 2, 5, 9, 4;
%e A191395 3, 6, 14, 12;
%e A191395 8, 9, 20, 25, 8;
%p A191395 eq := G = 1+z*G+z^2*G*(c+t/(1-t*z^2)-1/(1-z^2)): c := ((1-sqrt(1-4*z^2))*1/2)/z^2: g := simplify(solve(eq, G)): gser := simplify(series(g, z = 0, 19)): for n from 0 to 15 do P[n] := sort(expand(coeff(gser, z, n))) end do: for n from 0 to 15 do seq(coeff(P[n], t, k), k = 0 .. floor((1/2)*n)) end do; # yields sequence in triangular form
%Y A191395 Cf. A001405, A191393, A191397.
%K A191395 nonn,tabf
%O A191395 0,6
%A A191395 _Emeric Deutsch_, Jun 04 2011