Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069212
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A069212
%S A069212 1,4,7,10,13,22,25,28,31,40,43,52,55,64,73,76,79,88,91,100,109,118,121,
%T A069212 130,133,142,145,154,157,184,187,190,199,208,217,226,229,238,247,256,
%U A069212 259,286,289,298,307,316,319,328,331,340,349,358,361,370,379,388,397
%N A069212 a(n)=sum(k=1,n,3^omega(k)).
%C A069212 More generally, if b is an integer =>3, sum(k=1,n,b^omega(k))~C(b)*n*ln(n)^(b-1) 
               where C(b)=1/(b-1)!*prod((1-1/p)^(b-1)*(1+(b-1)/p))
%D A069212 G. Tenenbaum and Jie Wu, Cours Specialises No. 2: "Theorie analytique 
               et probabiliste des nombres", Collection SMF, Ordres moyens, p. 20.
%F A069212 Asymptotic formula : a(n)~C*n*ln(n)^2 with C= (1/2) *prod((1-1/p)^2*(1+2/
               p)) where the product is over all the primes.
%Y A069212 Sequence in context: A008470 A002640 A096675 this_sequence A091290 A119256 
               A143454
%Y A069212 Adjacent sequences: A069209 A069210 A069211 this_sequence A069213 A069214 
               A069215
%K A069212 easy,nonn
%O A069212 1,2
%A A069212 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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research