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

 


a(1)=2; a(n) is the smallest prime such that a(n)-a(n-1) is a 6th power (>0).
1

%I #5 Mar 30 2012 19:00:47

%S 2,3,67,131,2176782467,22485250805891,132514367714796227,

%T 132514373203827971,1472610013828827971,3552822265021773233027,

%U 3552822910800868882883,3552824349717606382019,3552824349723095413763

%N a(1)=2; a(n) is the smallest prime such that a(n)-a(n-1) is a 6th power (>0).

%C Since a(5) is 6 mod 7, all entries after a(5) are congruent to a(5) mod 14^6

%e a(4)=131 which is 2 mod 3 so if 131 +k^6 is prime, k must be divisible by 6. 131+6^6 and 131+24^6 are divisible by 13, 131 +12^6 and 131+18^6 are divisible by 5, 131+30^6 is divisible by 41, 131+36^6 is prime.

%Y Cf. A073609, A076201.

%K nonn

%O 1,1

%A _John L. Drost_, May 31 2005

%E Corrected by _T. D. Noe_, Nov 15 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 20 23:55 EDT 2024. Contains 376078 sequences. (Running on oeis4.)