|
| |
|
|
A063959
|
|
Sum of the primes from 1 to n!.
|
|
0
| |
|
|
0, 0, 2, 10, 100, 1593, 41741, 1578242, 80294846, 5356015580, 451223209946, 46900682786541, 5891009442510166, 879657744587755114, 153967535281046615774, 31216213430872403460411
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Sum of prime factors (without repetition) of (n!)!.
|
|
|
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: A124214 A098279 A099826 * A101686 A188193 A074109
Adjacent sequences: A063956 A063957 A063958 * A063960 A063961 A063962
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Sep 03 2001
|
|
|
EXTENSIONS
| Better description and more terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 04 2001
a(13)-a(15) from Donovan Johnson (donovan.johnson(AT)yahoo.com), May 03 2010
|
| |
|
|
