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 A060003 #28 Jul 23 2021 08:59:54
%S A060003 1,3,17,137,227,977,1187,1493,5777,5993
%N A060003 Odd numbers not of the form p + 2*k^2, k>0, p prime.
%C A060003 This sequence is probably finite.
%C A060003 Goldbach conjectured that all odd composites are sum of a prime and twice a square. a(9) = 5777 and a(10) = 5993 are the only known exceptions. Elements a(2) .. a(8) are the odd Stern primes (cf. A042978). The next element of the sequence, if it exists, is larger than 10^9. - _M. F. Hasler_, Nov 16 2007
%C A060003 The next term, if it exists, is larger than 2 * 10^13. - _Benjamin Chaffin_, Mar 28 2008
%C A060003 Terms greater than 3 are of the form 6*n-1. - _Dan Graham_, Mar 03 2015
%D A060003 David Wells, Penguin Dictionary of Curious and Interesting Numbers, Revised Edition, Penguin Books, London, 1997, page 76.
%H A060003 Laurent Hodges, <a href="https://www.jstor.org/stable/2690477">A lesser-known Goldbach conjecture</a>, Math. Mag., 66 (1993), 45-47.
%H A060003 Mark VandeWettering, <a href="https://brainwagon.org/2006/09/05/toying-with-a-lesser-known-goldbach-conjecture/">Toying with a lesser known Goldbach Conjecture</a>, 2006.
%t A060003 Do[ k = 1; While[ n - 2*k^2 > 1 && !PrimeQ[ n - 2*k^2 ], k++ ]; If[ n - 2*k^2 < 0, Print[n] ], { n, 5, 10^8 } ]
%o A060003 (PARI) forstep( n=1,2^30,2, for(s=1,sqrtint(n\2), if(isprime(n-2*s^2),next(2)));print(n)) \\ _M. F. Hasler_, Nov 16 2007
%Y A060003 Cf. A042978.
%K A060003 nonn,hard,more
%O A060003 1,2
%A A060003 _Robert G. Wilson v_, Mar 14 2001