|
Search: id:A134179
|
|
|
| A134179 |
|
Prime sums of k distinct (no overlap) sequential primes. |
|
+0
2
|
|
| 2, 31, 199, 659, 1601, 5693, 38917, 51797, 84463, 697373, 8059169, 8510617, 9465251, 28268543, 36254039, 40121999, 48667219, 54973229, 63627491, 90443813, 97626083, 102534899, 110364689, 139100699, 161967391, 183528421, 219566989
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
Compute sums of k distinct sequential primes (no overlap). If the sum is prime add the sum to the sequence.
|
|
EXAMPLE
|
a(2)=31 because at k=3, the 3 primes summed are 7+11+13=31, prime sum. At k=2 the two primes added are 3+5=8, composite, so 8 is not added to the sequence.
|
|
PROGRAM
|
UBASIC: 10 K=1 20 A=nxtprm(A):B=B+A:C=C+1: if C<>K then 20:else 30 30 L=B/K 31 print K; B; :Q=prmdiv(B): if Q=B then print B; "-":stop:else 40 40 B=0:K=K+1:C=0:goto 20
|
|
CROSSREFS
|
Cf. A134180 A134244 A134245 A134246.
Adjacent sequences: A134176 A134177 A134178 this_sequence A134180 A134181 A134182
Sequence in context: A101254 A107170 A042059 this_sequence A004307 A120357 A071360
|
|
KEYWORD
|
easy,nonn,uned
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Oct 16 2007
|
|
|
Search completed in 0.002 seconds
|
