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 A332888 #5 Mar 11 2020 21:27:10
%S A332888 1,1,1,2,2,2,3,2,4,4,4,6,4,5,3,3,5,3,3,7,6,5,2,5,3,3,5,10,5,7,5,6,8,7,
%T A332888 8,5,4,9,12,3,3,11,4,6,5,9,13,5,8,11,3,2,3,11,5,5,4,3,8,13,10,4,3,9,4,
%U A332888 8,4,6,14,5,2,6,10,6,6,3,9,2,3,11,9,7,7
%N A332888 a(n) = number of strict partition numbers that divide the n-th strict partition number.
%F A332888 a(n) = A332889(n) + 2.
%e A332888 Let p(n) = number of strict partitions of n. Then p(11) = 12, which is divisible by these 6 strict partition numbers: p(2) = 1, p(3) = 2, p(5) = 3, p(6) = 4, p(8) = 6, and p(11) = 12; thus a(11) = 6.
%t A332888 p[n_] := PartitionsQ[n]; t[n_] := Table[p[k], {k, 0, n}]
%t A332888 Table[Length[Intersection[t[n], Divisors[p[n]]]], {n, 0, 130}]
%Y A332888 Cf. A000009 (strict partition numbers), A322886, A332889.
%K A332888 nonn
%O A332888 0,4
%A A332888 _Clark Kimberling_, Mar 11 2020