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!)
A094668 a(n+1) = smallest prime p>a(n) such that p-a(k) is not a prime power for all k<=n; a(1)=2. 0

%I #3 Mar 30 2012 18:50:44

%S 2,17,23,37,47,59,71,89,107,113,131,137,149,167,173,179,191,197,227,

%T 233,239,251,257,263,269,281,311,317,331,337,359,373,383,419,431,443,

%U 449,461,467,479,491,503,509,521,557,563,569,599,613,641,647,653,659

%N a(n+1) = smallest prime p>a(n) such that p-a(k) is not a prime power for all k<=n; a(1)=2.

%Y Cf. A000040, A000961.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Jun 07 2004

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 23 07:56 EDT 2024. Contains 371905 sequences. (Running on oeis4.)