login
A327169
Number of distinct k such that A000005(k)*A000010(k) is equal to n.
5
1, 1, 0, 1, 0, 1, 0, 2, 0, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1, 0
OFFSET
1,8
COMMENTS
a(n) tells how many times in total n occurs in A062355.
LINKS
FORMULA
a(n) = Sum_{k=1..n} [A000005(k)*A000010(k) == n], where [ ] is the Iverson bracket.
PROG
(PARI) A327169(n) = sum(k=1, n, (eulerphi(k)*numdiv(k))==n);
CROSSREFS
Cf. also A327153, A327166.
Sequence in context: A008442 A338690 A343221 * A299173 A351726 A285720
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 19 2019
STATUS
approved