|
%I #39 Feb 11 2024 13:19:49
%S 5,5,17,13,37,5,5,41,101,61,5,5,197,113,257,5,5,181,401,13,5,5,577,
%T 313,677,5,5,421,17,13,5,5,13,613,1297,5,5,761,1601,29,5,5,13,1013,29,
%U 5,5,1201,41,1301,5,5,2917,17,3137,5,5,1741,13,1861,5,5,17,2113,4357,5,5
%N Smallest odd prime divisor of n^2 + 1.
%C Any odd prime divisor of n^2+1 is congruent to 1 modulo 4.
%C n^2+1 is never a power of 2 for n > 1; hence a prime divisor congruent to 1 modulo 4 always exists.
%C a(n) = 5 if and only if n is congruent to 2 or -2 modulo 5.
%C If the map "x -> smallest odd prime divisor of n^2+1" is iterated, does it always terminate in the 2-cycle (5 <-> 13)? - _Zoran Sunic_, Oct 25 2017
%D D. M. Burton, Elementary Number Theory, McGraw-Hill, Sixth Edition (2007), p. 191.
%H Ray Chandler, <a href="/A125256/b125256.txt">Table of n, a(n) for n = 2..20001</a> (first 999 terms from Nick Hobson)
%e The prime divisors of 8^2 + 1 = 65 are 5 and 13, so a(7) = 5.
%p with(numtheory, factorset);
%p A125256 := proc(n) local t1,t2;
%p if n <= 1 then return(-1); fi;
%p if (n mod 5) = 2 or (n mod 5) = 3 then return(5); fi;
%p t1 := numtheory[factorset](n^2+1);
%p t2:=sort(convert(t1,list));
%p if (n mod 2) = 1 then return(t2[2]); fi;
%p t2[1];
%p end;
%p [seq(A125256(n),n=1..40)]; # _N. J. A. Sloane_, Nov 04 2017
%o (PARI) vector(68, n, if(n<2, "-", factor(n^2+1)[1+(n%2),1]))
%o (PARI) A125256(n)=factor(n^2+1)[1+bittest(n,0),1] \\ _M. F. Hasler_, Nov 06 2017
%Y Cf. A002522, A002496, A014442, A057207, A031439.
%Y For bisections see A256970, A293958.
%Y See also A125257, A125258, A294656, A294657, A294658.
%K easy,nonn
%O 2,1
%A _Nick Hobson_, Nov 26 2006
|
