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.

A100496 Numbers n such that (2^n+1)^4-2 is prime.

Original entry on oeis.org

1, 7, 25, 31, 34, 271, 514, 2896, 8827, 16816, 37933
Offset: 1

Views

Author

Jonathan Vos Post, Nov 23 2004

Keywords

Comments

Some of the results were computed using the PrimeFormGW (PFGW) primality-testing program. - Hugo Pfoertner, Nov 14 2019
a(12) > 60000. - Tyler Busby, Feb 12 2023

Examples

			a(1) = 1 because (2^1+1)^4 - 2 = 79 is prime and is the first such prime.
		

Crossrefs

Cf. A100497, n such that (2^n+1)^4-2 is semiprime.

Programs

  • Mathematica
    Select[Range[5000], PrimeQ[(2^# + 1)^4 - 2] &]
  • PARI
    is(n)=ispseudoprime((2^n+1)^4-2) \\ Charles R Greathouse IV, Jun 13 2017

Extensions

Edited, corrected and extended by Ray Chandler and Hugo Pfoertner, Nov 26 2004
a(10)-a(11) from Tyler Busby, Feb 12 2023