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 A090875 #11 Apr 07 2022 10:55:15 %S A090875 1,1,1,1,1,2321204055,37185086099807 %N A090875 a(n) is the smallest number m such that m^(2^k) + 2^(2^k) is prime for k=0,1,...,n. %C A090875 The first five terms of this sequence correspond to Fermat primes. %C A090875 According to the answers to Prime Puzzle 399 (see link), a(6) is larger than 2.3*10^12. - _M. F. Hasler_, Aug 02 2007 %H A090875 Carlos Rivera (ed.), <a href="http://primepuzzles.net/puzzles/puzz_399.htm">Puzzle 399. Some more terms</a>, The Prime Puzzles and Problems Connection. %e A090875 a(5)=2321204055 because 2321204055 is the smallest number m such that m^(2^k) + 2^(2^k) is prime for k=0,1,2,3,4 and 5. %Y A090875 Cf. A090872, A090873, A090874. %K A090875 nonn %O A090875 0,6 %A A090875 _Farideh Firoozbakht_, Feb 06 2004 %E A090875 a(6) found by Kellen Shenton sent in by _Jeppe Stig Nielsen_, Apr 06 2022