|
Search: id:A066412
|
|
|
| A066412 |
|
Number of elements in the set phi_inverse(phi(n)). |
|
+0
1
|
|
| 2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 2, 4, 6, 4, 5, 5, 6, 4, 4, 5, 6, 2, 2, 5, 5, 6, 4, 6, 2, 5, 2, 6, 5, 6, 10, 6, 8, 4, 10, 6, 9, 6, 4, 5, 10, 2, 2, 6, 4, 5, 7, 10, 2, 4, 9, 10, 8, 2, 2, 6, 9, 2, 8, 7, 11, 5, 2, 7, 3, 10, 2, 10, 17, 8, 9, 8, 9, 10, 2, 7, 2, 9, 2, 10, 8, 4, 3, 9, 6, 10, 17, 3, 9, 2, 17, 7
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n)=Card( k>0 : cototient(k)=cototient(n) ) where cototient(x)=x-phi(x) - Benoit Cloitre (benoit7848c(AT)orange.fr), May 09 2002
|
|
EXAMPLE
|
invphi(6) = [7, 9, 14, 18], thus a(7) = a(9) = a(14) = a(18) = 4.
|
|
MAPLE
|
nops(invphi(phi(n)));
|
|
PROGRAM
|
(PARI) for(n=1, 150, print1(sum(i=1, 10*n, if(n-eulerphi(n)-i+eulerphi(i), 0, 1)), ", "))
|
|
CROSSREFS
|
Sequence in context: A105096 A157790 A070241 this_sequence A117119 A139141 A122953
Adjacent sequences: A066409 A066410 A066411 this_sequence A066413 A066414 A066415
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 25 2001
|
|
|
Search completed in 0.002 seconds
|
