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 A194828 #24 Mar 31 2012 10:29:10 %S A194828 7,11,21,23,55,83,167,611,887,1487,1571,10771,12227,13523,16321,44881, %T A194828 54863,57887,93167,189947,404939,442307,1746551,3383593,3544391, %U A194828 5056787,6811307,25619213,87170987,404940757,526805663,707095391,1009465507,1048720723 %N A194828 Odd numbers n>5 in the representation n=2*p+q, p, q prime, q minimal, at which a larger q than for any smaller n is needed. A194829 gives values of q. %C A194828 Related to Lemoine's conjecture, similar to A002091, but with q=1 excluded. Checked up to 2*10^13. %D A194828 See A002091. %H A194828 Hugo Pfoertner, <a href="/A194828/b194828.txt">Table of n, a(n) for n = 1..50</a> %H A194828 See A002091. %e A194828 a(4)=23, because 23 can only be represented by 23=2*5+13, whereas in A002091 23=2*11+1 avoids the need of increasing q for this representation. %Y A194828 Cf. A002091, A002092, A194829, A195353. %K A194828 nonn %O A194828 1,1 %A A194828 _Hugo Pfoertner_, Sep 03 2011