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.
%I A334053 #22 Jan 05 2021 03:44:44 %S A334053 2,2,2,2,2,96,6912,960,16256,2013184,235520,61184,125440,992256, %T A334053 155615232,550207488,12192710656 %N A334053 Least b such that b^(2^n) + 1 is a Proth prime (A080076). %C A334053 Every term b is in A116882 (the prime factor 2 of b must account for more than the square root of b). %C A334053 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. %H A334053 Chris K. Caldwell, The Prime Pages, <a href="https://primes.utm.edu/primes/page.php?id=131541">12192710656^65536 + 1</a> %o A334053 (PARI) a(n) = forstep(b=2,+oo,2,2*valuation(b,2)>logint(b,2)&&ispseudoprime(b^(2^n)+1)&&return(b)) %Y A334053 Cf. A056993, A080076, A116882. %K A334053 more,nonn %O A334053 0,1 %A A334053 _Jeppe Stig Nielsen_, Sep 07 2020 %E A334053 a(15) calculated by Pavel Atnashev added by _Jeppe Stig Nielsen_, Sep 18 2020 %E A334053 a(16) calculated by Pavel Atnashev added by _Jeppe Stig Nielsen_, Jan 05 2021