|
Search: id:A069924
|
|
|
| A069924 |
|
Number of k, 1<=k<=n, such that phi(k) divides k. |
|
+0
1
|
|
| 1, 2, 2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n)=Card(k: 1<=k<=n : k==0 (mod phi(k))) asymptotically : a(n)=C*ln(n)^2+o(ln(n)^2) with C=0, 6....
|
|
PROGRAM
|
(PARI) for(n=1, 150, print1(sum(i=1, n, if(i%eulerphi(i), 0, 1)), ", "))
|
|
CROSSREFS
|
Sequence in context: A140828 A035100 A085089 this_sequence A082479 A090616 A067434
Adjacent sequences: A069921 A069922 A069923 this_sequence A069925 A069926 A069927
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 05 2002
|
|
|
Search completed in 0.002 seconds
|
