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