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”).

A271321
Smallest prime factor of the n-th n-gonal number (A060354).
4
2, 2, 2, 5, 2, 2, 2, 3, 2, 2, 2, 13, 2, 2, 2, 11, 2, 2, 2, 3, 2, 2, 2, 5, 2, 2, 2, 29, 2, 2, 2, 3, 2, 2, 2, 37, 2, 2, 2, 11, 2, 2, 2, 3, 2, 2, 2, 7, 2, 2, 2, 53, 2, 2, 2, 3, 2, 2, 2, 7, 2, 2, 2, 5, 2, 2, 2, 3, 2, 2, 2, 73, 2, 2, 2, 7, 2, 2, 2, 3, 2, 2, 2, 5
OFFSET
2,1
LINKS
FORMULA
a(n) = A020639(A060354(n)).
EXAMPLE
a(5) = 5 because A060354(5) = 35 = 5 * 7.
MATHEMATICA
Table[FactorInteger[PolygonalNumber[n, n]][[1, 1]], {n, 2, 90}] (* Harvey P. Dale, Feb 26 2022 *)
PROG
(PARI)
pg(m, n) = (n^2*(m-2)-n*(m-4))/2 \\ n-th m-gonal number
spf(m) = factorint(m)[1, 1] \\ Smallest prime factor
a(n) = spf(pg(n, n))
vector(100, n, n++; a(n))
CROSSREFS
KEYWORD
nonn
AUTHOR
Colin Barker, Apr 04 2016
STATUS
approved