login
A066899
a(n) = card({k : phi(k) == n (mod k)}).
1
1, 3, 1, 4, 2, 5, 1, 7, 2, 3, 2, 7, 2, 5, 2, 7, 2, 5, 2, 10, 2, 3, 3, 15, 2, 3, 2, 5, 3, 3, 1, 12, 4, 5, 2, 9, 2, 7, 2, 12, 3, 7, 2, 8, 4, 3, 2, 16, 2, 5, 3, 4, 4, 9, 2, 10, 2, 3, 4, 12, 2, 5, 2, 15, 3, 3, 2, 9, 5, 5, 2, 20, 2, 5, 3, 8, 3, 5, 2, 15, 2, 3, 5, 12, 2
OFFSET
1,2
COMMENTS
Note that k=1 is excluded from the count. - Michel Marcus, Feb 22 2021
PROG
(PARI) a(n) = {my(v = invphi(n), m = if (#v, vecmax(v), n)); sum(i=2, m, Mod(eulerphi(i), i) == n); } \\ Michel Marcus, Feb 22 2021; needs invphi.gp
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 24 2002
EXTENSIONS
More terms from Michel Marcus, Feb 22 2021
STATUS
approved