|
Search: id:A069201
|
|
|
| A069201 |
|
a(n)=sum(k=1,n,mu(k)^2*2^omega(k)) where omega(k) is the number of distinct primes in k factorization. |
|
+0
2
|
|
| 1, 3, 5, 5, 7, 11, 13, 13, 13, 17, 19, 19, 21, 25, 29, 29, 31, 31, 33, 33, 37, 41, 43, 43, 43, 47, 47, 47, 49, 57, 59, 59, 63, 67, 71, 71, 73, 77, 81, 81, 83, 91, 93, 93, 93, 97, 99, 99, 99, 99, 103, 103, 105, 105, 109, 109, 113, 117, 119, 119, 121, 125, 125, 125, 129, 137
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
G. Tenenbaum and Jie Wu, Cours Specialises No. 2: "Theorie analytique et probabiliste des nombres", Collection SMF, Ordres moyens, p. 20.
|
|
FORMULA
|
Asymptotic formula: a(n)=C*n*ln(n)+O(n) with C=prod((1-1/p)^2*(1+2/p)) where the product is over all the primes.
|
|
CROSSREFS
|
Sequence in context: A122800 A063202 A058020 this_sequence A077800 A118409 A090941
Adjacent sequences: A069198 A069199 A069200 this_sequence A069202 A069203 A069204
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 14 2002
|
|
|
Search completed in 0.002 seconds
|
