OFFSET
1,1
COMMENTS
Or numbers n such that the smallest prime divisor of n^2+1 is A002313(5).
a(n)== 12 or 46 (mod 58).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
EXAMPLE
46 is in the sequence because 46^2+1= 29*73.
MATHEMATICA
lst={}; Do[If[FactorInteger[n^2+1][[1, 1]]==29, AppendTo[lst, n]], {n, 2, 2000}]; lst
p = 29; ps = Select[Range[p - 1], Mod[#, 4] != 3 && PrimeQ[#] &]; Select[Range[3000], Divisible[(nn = #^2 + 1), p] && ! Or @@ Divisible[nn, ps] &] (* Amiram Eldar, Aug 16 2019 *)
Select[Range[2, 3000, 2], FactorInteger[#^2+1][[1, 1]]==29&] (* or *) Select[ Flatten[ #+{12, 46}&/@(58*Range[0, 60])], FactorInteger[#^2+1][[1, 1]]==29&](* Harvey P. Dale, Jul 01 2022 *)
PROG
(Magma) [n: n in [2..3000] | PrimeDivisors(n^2+1)[1] eq 29]; // Bruno Berselli, Oct 08 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michel Lagneau, Oct 08 2014
STATUS
approved