Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139021
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 17179469033, 17179470433, 240518567327, 240518567479, 19807040628566083882989513161, 19807040628566083882989513433 (list; graph; listen)
OFFSET

0,1

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

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.

Sequence in context: A139052 A076491 A105226 this_sequence A145771 A042473 A042665

Adjacent sequences: A139018 A139019 A139020 this_sequence A139022 A139023 A139024

KEYWORD

nonn

AUTHOR

Leroy Quet Apr 06 2008

EXTENSIONS

9 more terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 28 2008

a(14)-a(19) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Nov 26 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research