login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248529 Numbers n such that the smallest prime divisor of n^2+1 is 29. 4
46, 104, 186, 220, 244, 360, 394, 510, 534, 626, 766, 800, 916, 940, 974, 1056, 1090, 1114, 1206, 1264, 1346, 1380, 1404, 1496, 1520, 1554, 1694, 1810, 1844, 1926, 1960, 2076, 2100, 2134, 2216, 2250, 2366, 2390, 2424, 2506, 2564, 2680, 2714, 2796, 2830, 2854 (list; graph; refs; listen; history; text; internal format)
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
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
Sequence in context: A287767 A050961 A264445 * A204769 A333040 A250778
KEYWORD
nonn,easy
AUTHOR
Michel Lagneau, Oct 08 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 18:58 EDT 2024. Contains 371798 sequences. (Running on oeis4.)