Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139019
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139019 a(1)=1. a(n) = smallest prime > a(n-1) such that sum{k=1 to n} a(k) is a power of a prime. +0
3
1, 2, 5, 11, 13, 17, 79, 83, 33554221, 33554501 (list; graph; listen)
OFFSET

1,2

PROGRAM

(PARI) s=p=1; for(i=1, 10, print1(k", "); while(omega(s+p=nextprime(p+1))>1, ); s+=p)

CROSSREFS

Cf. A139020, A139021.

Adjacent sequences: A139016 A139017 A139018 this_sequence A139020 A139021 A139022

Sequence in context: A019387 A019337 A086518 this_sequence A031869 A045360 A001915

KEYWORD

more,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Apr 06 2008

EXTENSIONS

Corrected and extended by M. F. Hasler (Maximilian.Hasler@gmail.com), Apr 06 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 October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research