|
Search: id:A139021
|
|
|
| A139021 |
|
a(0)=2. a(n) = smallest prime > a(n-1) such that (sum{k=0 to n} a(k)) is a power of a prime. |
|
+0
3
|
|
| 2, 3, 11, 13, 227, 307, 461, 463, 2609, 2683, 58757, 58831, 137777, 138007
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
EXAMPLE
|
The prime powers are 2+3=5^1, 2+3+11=2^4, 2+3+11+13=29^1, etc.
|
|
MAPLE
|
a := [2, 3] ; while true do as := add(i, i=a) ; p := nextprime(op(-1, a)) ; while nops(numtheory[factorset](p+as)) > 1 do p := nextprime(p) ; od; a := [op(a), p] ; print(a) ; od: -R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 28 2008
|
|
CROSSREFS
|
Cf. A139019, A139022.
Adjacent sequences: A139018 A139019 A139020 this_sequence A139022 A139023 A139024
Sequence in context: A139052 A076491 A105226 this_sequence A042473 A042665 A067919
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Apr 06 2008
|
|
EXTENSIONS
|
9 more terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 28 2008
|
|
|
Search completed in 0.002 seconds
|
