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.

Showing 1-1 of 1 results.

A006599 Numbers k such that 2^(2k+1) + 2^(k+1) + 1 is prime.

Original entry on oeis.org

0, 1, 2, 5, 9, 14, 78, 81, 141, 189, 498, 5070, 7349, 38645, 42618, 53346
Offset: 1

Views

Author

Keywords

Comments

Some of the larger entries may only correspond to probable primes.
Next term >= 10^4. - Jeppe Stig Nielsen, Mar 28 2014

References

  • J. Brillhart et al., Factorizations of b^n +- 1. Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 2nd edition, 1985; and later supplements.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

A108062 is essentially the same sequence.

Programs

  • PARI
    isok(n) = isprime(2^(2*n+1) + 2^(n+1) + 1); \\ Michel Marcus, Mar 28 2014

Formula

a(n) = A108062(n) - 1. - Michael S. Branicky, Jan 02 2025

Extensions

More terms from Rick L. Shepherd, Sep 07 2002
a(13) from Jeppe Stig Nielsen, Mar 28 2014
a(14)-a(16) from Michael S. Branicky, Jan 02 2025
Showing 1-1 of 1 results.