|
Search: id:A117528
|
|
| |
|
| 2, 3, 13, 41, 43, 109, 137, 167, 181, 199, 307, 373, 421, 491, 587, 661, 1009, 1097, 1117, 1373, 1471, 1483, 1601, 1607, 1787, 1913, 2053, 2089, 2203, 2267, 2591, 2819, 2953, 3191, 3361, 3623, 3691, 3779, 3877, 4051
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
At the twin primes 41 and 43, we obtain consecutive prime integer sums of 641 and 757.
|
|
FORMULA
|
Multiply consecutive primes by e, take integer, sum until a prime sum is reached.
|
|
EXAMPLE
|
In a(5)=4007, multiplication of the prime 109*e resulted in the int sum 296. When added to previous sums, the total came to 4007, a prime.
|
|
PROGRAM
|
UBASIC 10 Ct=1 20 B=nxtprm(B) 22 E=#e 30 C=int(B*E) 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. A117527 A117504.
Sequence in context: A082539 A100424 A141511 this_sequence A122719 A106866 A105050
Adjacent sequences: A117525 A117526 A117527 this_sequence A117529 A117530 A117531
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 25 2006
|
|
|
Search completed in 0.002 seconds
|
