|
Search: id:A117503
|
|
|
| A117503 |
|
Cumulative sum of int(prime*pi) which is prime. |
|
+0
3
|
|
| 613, 6229, 7607, 9679, 46133, 61469, 69191, 120067, 211663, 285049, 316697, 354323, 402371, 444979, 481109, 490313, 532709, 993907, 1055543, 1083721, 1237487, 1329701, 1409977, 1442899, 1484671, 1656199, 1700471, 1874767
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Modelled on same concept as cumulative sums of prime squares in A098562
|
|
FORMULA
|
Beginning with the first prime, multiply by pi, take integer; repeat, adding integer sums until a cumulative prime sum occurs. On the 12th prime, 37, the integer sum is 613, prime. Continue to next prime integer sum, 6229.
|
|
MAPLE
|
Digits := 30 ; A117503 := proc(nmax) local a, pisum, p ; a := [] ; pisum := 0 ; p :=1 ; while nops(a) <=nmax do while true do pisum := pisum+floor(Pi*ithprime(p)) ; p := p+1 ; if isprime(pisum) then a := [op(a), pisum] ; break ; fi ; od : od : RETURN(a) ; end: a := A117503(30) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 26 2006
|
|
PROGRAM
|
UBASIC 10 Ct=1 20 B=nxtprm(B) 30 C=int(pi(B)) 40 D=D+C 41 print Ct, B, C, D 50 if D=prmdiv(D) then print D:stop 55 Ct=Ct+1 60 goto 20
|
|
CROSSREFS
|
Cf. A117504, A098562.
Sequence in context: A090869 A020372 A032657 this_sequence A025329 A108818 A020377
Adjacent sequences: A117500 A117501 A117502 this_sequence A117504 A117505 A117506
|
|
KEYWORD
|
easy,nonn,less
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 25 2006
|
|
|
Search completed in 0.002 seconds
|
