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 A241630 #9 Aug 27 2021 03:16:40 %S A241630 8,73,429,1945,7465,25317,78068,222963,597644,1518370,3683950,8586866, %T A241630 19320391,42127208,89307361,184578961,372786467,737212357,1429992711, %U A241630 2724852920,5107392644,9427895421,17157142969,30810379849,54643242181,95783964110,166059755226 %N A241630 Number of compositions of n with exactly five descents. %H A241630 Joerg Arndt and Alois P. Heinz, <a href="/A241630/b241630.txt">Table of n, a(n) for n = 15..1000</a> %e A241630 a(15) = 8: [3,2,1,2,1,3,2,1], [3,2,1,3,2,1,2,1], [2,1,3,2,1,3,2,1], [2,1,2,1,3,2,1,2,1], [2,1,3,2,1,2,1,2,1], [3,2,1,2,1,2,1,2,1], [2,1,2,1,2,1,3,2,1], [2,1,2,1,2,1,2,1,2,1]. %p A241630 b:= proc(n, i) option remember; %p A241630 `if`(n=0, 1, convert(series(add(b(n-j, j)* %p A241630 `if`(j<i, x, 1), j=1..n), x, 6), polynom)) %p A241630 end: %p A241630 a:= n-> coeff(b(n, 0), x, 5): %p A241630 seq(a(n), n=15..50); %t A241630 k = 5; %t A241630 b[n_, i_] := b[n, i] = If[n == 0, 1, Sum[b[n - j, j]* %t A241630 If[j < i, x, 1], {j, n}] + O[x]^(k + 1)]; %t A241630 a[n_] := SeriesCoefficient[b[n, 0], {x, 0, k}]; %t A241630 a /@ Range[15, 50] (* _Jean-François Alcover_, Aug 27 2021, after Maple code *) %Y A241630 Column k=5 of A238343 and of A238344. %K A241630 nonn %O A241630 15,1 %A A241630 _Joerg Arndt_ and _Alois P. Heinz_, Apr 26 2014