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 A337364 #29 Jan 06 2022 18:43:43 %S A337364 1,240164550712338756,3686834112771042790,6470860179642426900, %T A337364 7529068955648085700,10300630358100537120,16776829808789151280, %U A337364 17622040391833711780,19344979062504927000,23949099004395080026,25348938242408650240,30262840543567048476,35628481193915651646 %N A337364 Numbers b such that b^(2^i) + 1 is prime for i = 0...7. %C A337364 Explicitly, for each b, the eight numbers b+1, b^2+1, b^4+1, b^8+1, b^16+1, b^32+1, b^64+1, and b^128+1 must be primes (generalized Fermat primes). %H A337364 Jeppe Stig Nielsen, <a href="/A337364/b337364.txt">Table of n, a(n) for n = 1..31</a> (found by Rob Gahan) %H A337364 Yves Gallot, <a href="https://github.com/galloty/GFP/">GFP (Generalized Fermat Progressions) / gfp8</a>, software for calculating this sequence. %Y A337364 Cf. A006093, A019434, A056993, A070325, A070655, A070689, A070694, A090872, A235390, A335805. %K A337364 nonn %O A337364 1,2 %A A337364 _Jeppe Stig Nielsen_, Aug 25 2020 %E A337364 a(10)-a(12) from _Jeppe Stig Nielsen_, Sep 04 2020 %E A337364 a(13) found by Rob Gahan added by _Jeppe Stig Nielsen_, Feb 15 2021