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.

A334053 Least b such that b^(2^n) + 1 is a Proth prime (A080076).

Original entry on oeis.org

2, 2, 2, 2, 2, 96, 6912, 960, 16256, 2013184, 235520, 61184, 125440, 992256, 155615232, 550207488, 12192710656
Offset: 0

Views

Author

Jeppe Stig Nielsen, Sep 07 2020

Keywords

Comments

Every term b is in A116882 (the prime factor 2 of b must account for more than the square root of b).
For n up to about 11, a(n) can be found with the PARI function below. From there up to n=14, you can find a(n) by filtering lists of known primes of the form b^(2^n) + 1.

Crossrefs

Programs

  • PARI
    a(n) = forstep(b=2,+oo,2,2*valuation(b,2)>logint(b,2)&&ispseudoprime(b^(2^n)+1)&&return(b))

Extensions

a(15) calculated by Pavel Atnashev added by Jeppe Stig Nielsen, Sep 18 2020
a(16) calculated by Pavel Atnashev added by Jeppe Stig Nielsen, Jan 05 2021