login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063959 Sum of the primes from 1 to n!. 1
0, 0, 2, 10, 100, 1593, 41741, 1578242, 80294846, 5356015580, 451223209946, 46900682786541, 5891009442510166, 879657744587755114, 153967535281046615774, 31216213430872403460411, 7256556722488434503836458, 1917031284234466887065107947, 571083301099266868435687532291 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Sum of prime factors (without repetition) of (n!)!.
LINKS
EXAMPLE
a(4) = sum of primes <= 24. They are 2, 3, 5, 7, 11, 13, 17, 19 and 23. This sum is 100.
MATHEMATICA
NextPrim[n_] := (k = n + 1; While[ ! PrimeQ[k], k++ ]; k); s = 0; p = 1; Do[ Do[p = NextPrim[p]; s = s + p, {i, PrimePi[(n - 1)! ] + 1, PrimePi[(n)! ]}]; Print[s], {n, 1, 12} ]
Do[ Print[ Sum[ Prime[k], {k, 1, PrimePi[n! ]}]], {n, 0, 10} ]
PROG
(PARI)sumprime(n, s, fac, i)=fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]); return(s); for(n=0, 22, print(sumprime(n!!)))
CROSSREFS
Sequence in context: A277468 A099826 A338193 * A101686 A324241 A188193
KEYWORD
nonn
AUTHOR
Jason Earls, Sep 03 2001
EXTENSIONS
Better description and more terms from Robert G. Wilson v, Oct 04 2001
a(13)-a(15) from Donovan Johnson, May 03 2010
a(16)-a(18) from Daniel Suteu, Nov 15 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)