Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071811
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071811 Sum_{k <= 10^n} number of primes (counted with multiplicity) dividing k (A001222). +0
1
0, 15, 239, 2877, 31985, 343614, 3626619, 37861249, 392351272, 4044220058 (list; graph; listen)
OFFSET

0,2

COMMENT

Also bigomega( (10^n)! ), where bigomega(x): number of prime divisors of x, counted with multiplicity. - Cino Hilliard (hillcino368(AT)hotmail.com), Jul 04 2007

EXAMPLE

a(1)=15 because bigomega(1)+bigomega(2)+...+bigomega(10)=0+1+1+2+1+2+1+3+2+2=15.

PROGRAM

(PARI) s=0; n=0; for(k=1, 10^8, s=s+bigomega(k); if(k==10^n, print1(s, ", "); n++))

(PARI) g(n) = for(x=0, n, print1(bigomega((10^x)!), ", ")) - Cino Hilliard (hillcino368(AT)hotmail.com), Jul 04 2007

CROSSREFS

Cf. A001222 (bigomega), A064182 (corresponding sums for distinct primes).

Sequence in context: A097582 A057007 A093745 this_sequence A157456 A097262 A158557

Adjacent sequences: A071808 A071809 A071810 this_sequence A071812 A071813 A071814

KEYWORD

nonn

AUTHOR

Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jun 07 2002

EXTENSIONS

a(9) from Charles R Greathouse IV Dec 11 2008

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified February 9 11:24 EST 2010. Contains 172296 sequences.


AT&T Labs Research