A327169 Number of distinct k such that A000005(k)*A000010(k) is equal to n.

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

Antti Karttunen, Table of n, a(n) for n = 1..20000

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. A000005, A000010, A062355.

Cf. also A327153, A327166.

Sequence in context: A008442 A338690 A343221 * A299173 A351726 A285720

Adjacent sequences: A327166 A327167 A327168 * A327170 A327171 A327172

Keyword

nonn

Author

Antti Karttunen, Sep 19 2019

Status

approved