OFFSET
2,1
COMMENTS
Every Mersenne prime number appears on this sequence. a(n) mod 8 = 1 or 7.
LINKS
Bernhard Helmes, Prime sieving on the polynomial f(n)=2n^2-1.
MATHEMATICA
Rest[DeleteDuplicates[#[[1]]&/@(Flatten[FactorInteger/@(2*Range[100]^2-1), 1])]] (* Harvey P. Dale, Nov 15 2014 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Bernhard Helmes (pi(AT)devalco.de), Sep 23 2008
EXTENSIONS
Definition clarified by Harvey P. Dale, Nov 15 2014
STATUS
approved