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 A100496 #20 Feb 12 2023 11:07:53 %S A100496 1,7,25,31,34,271,514,2896,8827,16816,37933 %N A100496 Numbers n such that (2^n+1)^4-2 is prime. %C A100496 Some of the results were computed using the PrimeFormGW (PFGW) primality-testing program. - _Hugo Pfoertner_, Nov 14 2019 %C A100496 a(12) > 60000. - _Tyler Busby_, Feb 12 2023 %e A100496 a(1) = 1 because (2^1+1)^4 - 2 = 79 is prime and is the first such prime. %t A100496 Select[Range[5000], PrimeQ[(2^# + 1)^4 - 2] &] %o A100496 (PARI) is(n)=ispseudoprime((2^n+1)^4-2) \\ _Charles R Greathouse IV_, Jun 13 2017 %Y A100496 Cf. A091513, A091514, A093069, A099359. %Y A100496 Cf. A100497, n such that (2^n+1)^4-2 is semiprime. %K A100496 more,nonn %O A100496 1,2 %A A100496 _Jonathan Vos Post_, Nov 23 2004 %E A100496 Edited, corrected and extended by _Ray Chandler_ and _Hugo Pfoertner_, Nov 26 2004 %E A100496 a(10)-a(11) from _Tyler Busby_, Feb 12 2023