Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069205
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069205 a(n)=sum(k=1,n,2^bigomega(k)). +0
1
1, 3, 5, 9, 11, 15, 17, 25, 29, 33, 35, 43, 45, 49, 53, 69, 71, 79, 81, 89, 93, 97, 99, 115, 119, 123, 131, 139, 141, 149, 151, 183, 187, 191, 195, 211, 213, 217, 221, 237, 239, 247, 249, 257, 265, 269, 271, 303, 307, 315, 319, 327, 329, 345, 349, 365, 369, 373 (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)=1/8/ln(2)*C*n*ln(n)^2+O(nln(n)) with C=prod((1+1/p/(p-2)) where the product is over all the primes p>2.

CROSSREFS

Adjacent sequences: A069202 A069203 A069204 this_sequence A069206 A069207 A069208

Sequence in context: A120696 A071156 A076610 this_sequence A064988 A052092 A075991

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 14 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 11 10:28 EDT 2008. Contains 139662 sequences.


AT&T Labs Research