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 A360764 #30 Nov 17 2023 11:57:00
%S A360764 1,0,1,0,1,0,1,2,0,1,2,1,0,1,4,2,0,1,4,6,1,0,1,6,8,4,0,1,6,13,9,1,0,1,
%T A360764 8,18,16,6,0,1,8,24,29,13,2,0,1,10,30,43,29,6,0,1,10,39,64,52,19,1,0,
%U A360764 1,12,46,89,89,42,7,0,1,12,56,122,139,85,22,1
%N A360764 Number T(n,k) of sets of nonempty strict integer partitions with a total of k parts and total sum of n; triangle T(n,k), n>=0, 0<=k<=max(i:T(n,i)>0), read by rows.
%C A360764 T(n,k) is defined for all n >= 0 and k >= 0. Terms that are not in the triangle are zero.
%H A360764 Alois P. Heinz, <a href="/A360764/b360764.txt">Rows n = 0..250, flattened</a>
%e A360764 T(6,1) = 1: {[6]}.
%e A360764 T(6,2) = 4: {[1],[5]}, {[2],[4]}, {[1,5]}, {[2,4]}.
%e A360764 T(6,3) = 6: {[1,2,3]}, {[1],[1,4]}, {[1],[2,3]}, {[2],[1,3]}, {[3],[1,2]}, {[1],[2],[3]}.
%e A360764 T(6,4) = 1: {[1],[2],[1,2]}.
%e A360764 Triangle T(n,k) begins:
%e A360764 1;
%e A360764 0, 1;
%e A360764 0, 1;
%e A360764 0, 1, 2;
%e A360764 0, 1, 2, 1;
%e A360764 0, 1, 4, 2;
%e A360764 0, 1, 4, 6, 1;
%e A360764 0, 1, 6, 8, 4;
%e A360764 0, 1, 6, 13, 9, 1;
%e A360764 0, 1, 8, 18, 16, 6;
%e A360764 0, 1, 8, 24, 29, 13, 2;
%e A360764 0, 1, 10, 30, 43, 29, 6;
%e A360764 0, 1, 10, 39, 64, 52, 19, 1;
%e A360764 ...
%p A360764 h:= proc(n, i) option remember; expand(`if`(n=0, 1,
%p A360764 `if`(i<1, 0, h(n, i-1)+x*h(n-i, min(n-i, i-1)))))
%p A360764 end:
%p A360764 g:= proc(n, i, j) option remember; expand(`if`(j=0, 1, `if`(i<0, 0, add(
%p A360764 g(n, i-1, j-k)*x^(i*k)*binomial(coeff(h(n$2), x, i), k), k=0..j))))
%p A360764 end:
%p A360764 b:= proc(n, i) option remember; expand(`if`(n=0, 1,
%p A360764 `if`(i<1, 0, add(b(n-i*j, i-1)*g(i$2, j), j=0..n/i))))
%p A360764 end:
%p A360764 T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b(n$2)):
%p A360764 seq(T(n), n=0..14);
%t A360764 h[n_, i_] := h[n, i] = Expand[If[n == 0, 1, If[i < 1, 0, h[n, i - 1] + x*h[n - i, Min[n - i, i - 1]]]]];
%t A360764 g[n_, i_, j_] := g[n, i, j] = Expand[If[j == 0, 1, If[i<0, 0, Sum[g[n, i - 1, j - k]*x^(i*k)*Binomial[Coefficient[h[n, n], x, i], k], {k, 0, j}]]]];
%t A360764 b[n_, i_] := b[n, i] = Expand[If[n == 0, 1, If[i < 1, 0, Sum[b[n - i*j, i - 1]*g[i, i, j], {j, 0, n/i}]]]] ;
%t A360764 T[n_] := CoefficientList[b[n, n], x];
%t A360764 Table[T[n], {n, 0, 14}] // Flatten (* _Jean-François Alcover_, Nov 17 2023, after _Alois P. Heinz_ *)
%Y A360764 Columns k=0-2 give: A000007, A057427, A052928(n-1) for n>=3.
%Y A360764 Row sums give A050342.
%Y A360764 Cf. A000009, A008289, A055884, A330462, A360742, A360763.
%K A360764 nonn,tabf
%O A360764 0,8
%A A360764 _Alois P. Heinz_, Feb 19 2023