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.

A182425 a(n) the largest integer K such that (prime(n+1)-1)^(2^k)+1 for 0<=k<=K is prime.

Original entry on oeis.org

4, 3, 2, 1, 0, 2, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 2, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Thomas Ordowski, Apr 28 2012

Keywords

Comments

This sequence is a generalized reference to Fermat primes.

Crossrefs

Cf. A182199.

Programs

  • Mathematica
    Table[k = 0; While[PrimeQ[(Prime[n+1] - 1)^(2^k) + 1], k++];  k - 1, {n, 100}] (* T. D. Noe, Apr 28 2012 *)