login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2

%I #9 Apr 09 2014 10:14:06

%S 1,2,5,11,13,17,79,83,33554221,33554501,2198956146619,2198956147781,

%T 9002801275337659,9002801275339331

%N 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.

%C Next terms are a(15) = 2^1685 - 18010000530080323, a(16) = 2^1685 - 18010000529304693.

%Y Cf. A139020, A139021.

%K nonn

%O 1,2

%A _Leroy Quet_, Apr 06 2008

%E Corrected and extended by _M. F. Hasler_, Apr 06 2008

%E a(11)-a(14) from _Donovan Johnson_, Nov 30 2008

%E a(15)-a(16) from _Max Alekseyev_, Feb 01 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)