login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A089123
Smallest prime factor of numbers of the form A^2 + 3.
1
2, 7, 2, 19, 2, 3, 2, 67, 2, 103, 2, 3, 2, 199, 2, 7, 2, 3, 2, 13, 2, 487, 2, 3, 2, 7, 2, 787, 2, 3, 2, 13, 2, 19, 2, 3, 2, 1447, 2, 7, 2, 3, 2, 7, 2, 13, 2, 3, 2, 2503, 2, 2707, 2, 3, 2, 43, 2, 7, 2, 3, 2, 3847, 2, 4099, 2, 3, 2, 7, 2, 4903, 2, 3, 2, 5479, 2, 5779, 2, 3, 2, 19, 2, 7, 2, 3, 2, 7
OFFSET
1,1
REFERENCES
H. Rademacher, Lectures on Elementary Number Theory, pp. 33-38.
LINKS
MATHEMATICA
FactorInteger[#][[1, 1]]&/@(Range[90]^2+3) (* Harvey P. Dale, Apr 22 2018 *)
PROG
(PARI) smallasqp3(m) = { for(a=1, m, y=a^2 + 3; f = factor(y); v = component(f, 1); v1 = v[length(v)]; print1(v[1]", ") ) }
CROSSREFS
Cf. A002496.
Sequence in context: A222654 A318059 A212835 * A281751 A282366 A281897
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Dec 05 2003
STATUS
approved