OFFSET
1,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
FORMULA
Based on comments from Zak Seidov, Don Reble and M. F. Hasler, we now know that these are the numbers k such that k == 1 (mod 3) and 2k + 9 is composite. - N. J. A. Sloane, Apr 20 2008
MATHEMATICA
a = {}; Do[p = 0; While[(! PrimeQ[2*n + Prime[p + 1]^2]) && (p < 10000), p++ ]; If[p < 10000, [null], AppendTo[a, n]], {n, 1, 550}]; a
Select[Range[400], Mod[#, 3]==1&&CompositeQ[2#+9]&] (* Harvey P. Dale, Feb 23 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Artur Jasinski, Mar 26 2008
STATUS
approved