A160491 First differences of A062481.

7, 235, 16141, 48811741, 13011865891, 232617453293191, 143882557561868665, 8862794004464425240057, 99999991137061880347498904071, 191843424957750480504146841291811

Offset

1,1

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.

Links

Table of n, a(n) for n=1..10.

C.L. Hilliard,Primes less than 3 trillion

Formula

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

Example

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

Prog

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

Crossrefs

Sequence in context: A081618 A285369 A287042 * A120661 A366703 A185389

Adjacent sequences: A160488 A160489 A160490 * A160492 A160493 A160494

Keyword

nonn

Author

Cino Hilliard, May 15 2009

Extensions

Edited by R. J. Mathar, May 17 2009

Status

approved