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.

A075469 Maximal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.

Original entry on oeis.org

1, 20, 253, 3122, 46651, 823540, 16777155, 387420478, 9999999939, 285311670528, 8916100448227, 302875106592216, 11112006825558003, 437893890380859368, 18446744073709551537, 827240261886336764070, 39346408075296537575383
Offset: 2

Views

Author

Lior Manor, Sep 18 2002

Keywords

Comments

Are there any negative terms?
Of course the Goldbach conjecture implies that the answer is "no"; further, the first thousand terms are positive. - Charles R Greathouse IV, Mar 16 2016

Examples

			a(4) = 253 since 4^4-253 = 3 and 4^4+253 = 509 are both prime.
		

Crossrefs

Programs

  • PARI
    a(n)=my(N=n^n); forprime(p=2,N, if(isprime(2*N-p), return(N-p))); -1 \\ Charles R Greathouse IV, Mar 16 2016

Formula

a(n) = A047949(n^n). - Michel Marcus, Jun 09 2013