|
%I M1505 #27 Sep 08 2022 08:44:33
%S 2,5,17,13,37,41,101,61,29,197,113,257,181,401,97,53,577,313,677,73,
%T 157,421,109,89,613,1297,137,761,1601,353,149,1013,461,1201,1301,541,
%U 281,2917,3137,673,1741,277,1861,769,397,241,2113,4357,449,2381,2521,5477
%N Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.
%C Primes associated with Stormer numbers.
%C See A002313 for the sorted list of primes. It can be shown that k^2 + 1 has at most one primitive prime factor; the other prime factors divide m^2 + 1 for some m < k. When k^2 + 1 has a primitive prime factor, k is a Stormer number (A005528), otherwise a non-Stormer number (A002312).
%D John H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, p. 246.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D J. Todd, Table of Arctangents. National Bureau of Standards, Washington, DC, 1951, p. vi.
%H T. D. Noe, <a href="/A005529/b005529.txt">Table of n, a(n) for n = 1..1000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/StormerNumber.html">Stormer Number.</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PrimitivePrimeFactor.html">Primitive Prime Factor</a>
%t prms={}; Do[f=First/@FactorInteger[k^2+1]; p=Complement[f, prms]; prms=Join[prms, p], {k, 100}]; prms
%o (Magma) V:=[]; for n in [1..75] do p:=Max([ x[1]: x in Factorization(n^2+1) ]); if not p in V then Append(~V, p); end if; end for; V; - _Klaus Brockhaus_, Oct 29 2008
%o (PARI) do(n)=my(v=List(),g=1,m,t,f); for(k=1,n, m=k^2+1; t=gcd(m,g); while(t>1, m/=t; t=gcd(m,t)); f=factor(m)[,1]; if(#f, listput(v,f[1]); g*=f[1])); Vec(v) \\ _Charles R Greathouse IV_, Jun 11 2017
%Y Cf. A002312, A002313 (primes of the form 4k+1), A002522, A005528.
%K nonn
%O 1,1
%A _N. J. A. Sloane_.
%E Edited by _T. D. Noe_, Oct 02 2003
|
