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 A065397 #9 Aug 04 2015 23:43:16 %S A065397 2,7,61,211 %N A065397 Primes which have no representation p + k*(k+1) / 2, with p prime and k > 0: A000040-Complement of A065396. %C A065397 Finite? (Checked up to A000040(100000) = 1299709.) %C A065397 Next term > 7000000. - _R. J. Mathar_, Apr 23 2006 %C A065397 No other terms less than 2*10^9. - _T. D. Noe_, Mar 26 2008 %p A065397 for n from 1 to 7000000 do if isprime(n) = true then foundp := false ; for k from 1 to n do if isprime(n-k*(k+1)/2) = true then foundp := true ; break ; elif n-k*(k+1)/2 < 2 then break ; fi ; od ; if foundp = false then print(n) ; fi ; fi ; od : # _R. J. Mathar_, Apr 23 2006 %Y A065397 Cf. A000040, A000217, A065377, A065396. %K A065397 more,nonn %O A065397 1,1 %A A065397 _Reinhard Zumkeller_, Nov 05 2001