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 A118539 #29 Nov 17 2019 15:49:22 %S A118539 3,3,3,75,113,2163,63739,13221,54809,3656571,6992033,125441,103859115, %T A118539 56414915,87888967 %N A118539 Adjacent generalized Fermat primes. %C A118539 a(15)=87888967 but a(14) is unknown. - _Jeppe Stig Nielsen_, Mar 17 2018 %C A118539 The prime pair related to a(14) was found four days ago, and today double checking has proved that they are indeed the first occurrence for n=14. - _Jeppe Stig Nielsen_, May 02 2018 %H A118539 David Broadhurst, <a href="http://groups.yahoo.com/group/primeform/message/7397">Posting to PrimeForm</a> list. %H A118539 David Broadhurst, Chris Caldwell and others, <a href="/A118539/a118539.txt">GFN near mid-air collision</a>, digest of 16 messages in primeform Yahoo group, May 2 - May 5, 2006. [Cached copy] %H A118539 Yves Gallot's compilation of <a href="http://yves.gallot.pagesperso-orange.fr/primes/results.html">generalized Fermat</a> primes. %F A118539 a(n) is the smallest number such that (a(n)+1)^(2^n)+1 and (a(n)-1)^(2^n)+1 are both prime. %F A118539 a(n) = A217993(n) + 1. - _Jeppe Stig Nielsen_, Feb 27 2016 %e A118539 a(11)=6992033 because 6992034^2048+1 is prime, 6992032^2048+1 is prime and no smaller pair of bases differing by 2 gives a pair of primes with the exponent 2^11=2048. %Y A118539 Cf. A217993. %K A118539 hard,more,nonn %O A118539 1,1 %A A118539 _David Broadhurst_, May 06 2006 %E A118539 a(13) from _Jeppe Stig Nielsen_, Mar 17 2018 %E A118539 a(14) and a(15) from _Jeppe Stig Nielsen_, May 02 2018