cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

2, 3, 67, 131, 2176782467, 22485250805891, 132514367714796227, 132514373203827971, 1472610013828827971, 3552822265021773233027, 3552822910800868882883, 3552824349717606382019, 3552824349723095413763
Offset: 1

Views

Author

John L. Drost, May 31 2005

Keywords

Comments

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

Examples

			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.
		

Crossrefs

Extensions

Corrected by T. D. Noe, Nov 15 2006