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 A225624 #32 Mar 24 2017 00:47:55
%S A225624 1,2,0,3,1,0,4,5,0,0,5,15,3,0,0,6,35,25,1,0,0,7,70,117,28,0,0,0,8,126,
%T A225624 405,271,22,0,0,0,9,210,1155,1631,483,13,0,0,0,10,330,2871,7359,5126,
%U A225624 711,5,0,0,0,11,495,6435,27223,36526,13482,889,1,0,0,0,12,715,13299,86919,199924,151276,30906,962,0,0,0,0
%N A225624 Triangle read by rows: T(n,k) is the number of descent sequences of length n with exactly k-1 descents, n>=1, 1<=k<=n.
%C A225624 A descent sequence is a sequence [d(1), d(2), ..., d(n)] where d(1)=0, d(k)>=0, and d(k) <= 1 + desc([d(1), d(2), ..., d(k-1)]) where desc(.) gives the number of descents of its argument, see example.
%C A225624 Row sums are A225588 (number of descent sequences).
%C A225624 First column is C(n,1)=n, second column is C(n+1,4) = A000332(n+1), third column appears to be A095664(n-5) for n>=5.
%H A225624 Joerg Arndt and Alois P. Heinz, <a href="/A225624/b225624.txt">Rows n = 1..100, flattened</a> (Rows n = 1..18 from Joerg Arndt)
%e A225624 Triangle begins:
%e A225624 01: 1,
%e A225624 02: 2, 0,
%e A225624 03: 3, 1, 0,
%e A225624 04: 4, 5, 0, 0,
%e A225624 05: 5, 15, 3, 0, 0,
%e A225624 06: 6, 35, 25, 1, 0, 0,
%e A225624 07: 7, 70, 117, 28, 0, 0, 0,
%e A225624 08: 8, 126, 405, 271, 22, 0, 0, 0,
%e A225624 09: 9, 210, 1155, 1631, 483, 13, 0, 0, 0,
%e A225624 10: 10, 330, 2871, 7359, 5126, 711, 5, 0, 0, 0,
%e A225624 11: 11, 495, 6435, 27223, 36526, 13482, 889, 1, 0, 0, 0,
%e A225624 12: 12, 715, 13299, 86919, 199924, 151276, 30906, 962, 0, 0, 0, 0,
%e A225624 13: 13, 1001, 25740, 247508, 903511, 1216203, 546001, 63462, 903, 0, 0, 0, 0,
%e A225624 ...
%e A225624 The number of descents for the A225588(5)=23 descent sequences of length 5 are (dots for zeros):
%e A225624 .#: descent seq. no. of descents
%e A225624 01: [ . . . . . ] 0
%e A225624 02: [ . . . . 1 ] 0
%e A225624 03: [ . . . 1 . ] 1
%e A225624 04: [ . . . 1 1 ] 0
%e A225624 05: [ . . 1 . . ] 1
%e A225624 06: [ . . 1 . 1 ] 1
%e A225624 07: [ . . 1 . 2 ] 1
%e A225624 08: [ . . 1 1 . ] 1
%e A225624 09: [ . . 1 1 1 ] 0
%e A225624 10: [ . 1 . . . ] 1
%e A225624 11: [ . 1 . . 1 ] 1
%e A225624 12: [ . 1 . . 2 ] 1
%e A225624 13: [ . 1 . 1 . ] 2
%e A225624 14: [ . 1 . 1 1 ] 1
%e A225624 15: [ . 1 . 1 2 ] 1
%e A225624 16: [ . 1 . 2 . ] 2
%e A225624 17: [ . 1 . 2 1 ] 2
%e A225624 18: [ . 1 . 2 2 ] 1
%e A225624 19: [ . 1 1 . . ] 1
%e A225624 20: [ . 1 1 . 1 ] 1
%e A225624 21: [ . 1 1 . 2 ] 1
%e A225624 22: [ . 1 1 1 . ] 1
%e A225624 23: [ . 1 1 1 1 ] 0
%e A225624 There are 5 sequences with 0 descents, 15 with 1 descents, 3 with 2 descents, and 0 for 3 or 5 descents. Therefore row 5 is [5, 15, 3, 0, 0].
%p A225624 b:= proc(n, i, t) option remember; local j; if n<1 then [0$t, 1]
%p A225624 else []; for j from 0 to t+1 do zip((x, y)->x+y, %,
%p A225624 b(n-1, j, t+`if`(j<i, 1, 0)), 0) od; % fi
%p A225624 end:
%p A225624 T:= proc(n) local l; l:= b(n-1, 0, 0): l[], 0$(n-nops(l)) end:
%p A225624 seq(T(n), n=1..13); # _Alois P. Heinz_, May 18 2013
%t A225624 b[n_, i_, t_] := b[n, i, t] = Module[{j, pc}, If[n<1, Append[Array[0 &, t], 1], pc = {}; For[j = 0, j <= t+1, j++, pc = Plus @@ PadRight[ {pc, b[n-1, j, t+If[j<i, 1, 0]]}]]; pc]]; T[n_] := Module[{l}, l = b[n-1, 0, 0]; Join[l, Array[0&, n-Length[l]]]]; Table[T[n], {n, 1, 12}] // Flatten (* _Jean-François Alcover_, Feb 27 2014, after _Alois P. Heinz_ *)
%o A225624 (Sage) # After Alois P. Heinz.
%o A225624 @CachedFunction
%o A225624 def b(n, i, t, N):
%o A225624 B = [0 for x in range(N)]
%o A225624 if n < 1: B[t] = 1; return B
%o A225624 for j in (0..t+1):
%o A225624 B = map(operator.add, B, b(n-1, j, t+int(j<i), N))
%o A225624 return B
%o A225624 def T(n): return b(n-1, 0, 0, n)
%o A225624 for n in (1..9): T(n) # _Peter Luschny_, May 20 2013; updated May 21 2013
%K A225624 nonn,tabl
%O A225624 1,2
%A A225624 _Joerg Arndt_, May 11 2013