login
A332888
a(n) = number of strict partition numbers that divide the n-th strict partition number.
1
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, 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, 8, 4, 6, 14, 5, 2, 6, 10, 6, 6, 3, 9, 2, 3, 11, 9, 7, 7
OFFSET
0,4
FORMULA
a(n) = A332889(n) + 2.
EXAMPLE
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.
MATHEMATICA
p[n_] := PartitionsQ[n]; t[n_] := Table[p[k], {k, 0, n}]
Table[Length[Intersection[t[n], Divisors[p[n]]]], {n, 0, 130}]
CROSSREFS
Cf. A000009 (strict partition numbers), A322886, A332889.
Sequence in context: A046798 A329434 A157231 * A258596 A273784 A318058
KEYWORD
nonn
AUTHOR
Clark Kimberling, Mar 11 2020
STATUS
approved