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.

A160491 First differences of A062481.

Original entry on oeis.org

7, 235, 16141, 48811741, 13011865891, 232617453293191, 143882557561868665, 8862794004464425240057, 99999991137061880347498904071, 191843424957750480504146841291811
Offset: 1

Views

Author

Cino Hilliard, May 15 2009

Keywords

Comments

a(1), a(3) and a(6) are the only primes found for n up to 10000 using The C/Gmp program in the link which is 17 times faster than the PARI routine. We read large blocks of primes into memory and test in memory.
If another prime exists, it is larger than 418977 digits.
A concept of order can be introduced here by researching and analyzing the next-nextprime, next-next-nextprime etc.

Examples

			For n = 3, 4^7 - 3^3 = 16141, the 3rd entry in the sequence.
		

Programs

  • PARI
    ppower(n) = { for(x=1,n, y=(x+1)^prime(x+1)-x^prime(x); print1(y",") ); }

Formula

a(n) = A062481(n+1) - A062481(n).

Extensions

Edited by R. J. Mathar, May 17 2009