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

A328823
a(n) is the least prime factor of A000096(n) = n*(n+3)/2.
1
2, 5, 3, 2, 2, 3, 5, 2, 2, 5, 7, 2, 2, 7, 3, 2, 2, 3, 11, 2, 2, 5, 13, 2, 2, 13, 3, 2, 2, 3, 17, 2, 2, 17, 5, 2, 2, 19, 3, 2, 2, 3, 23, 2, 2, 7, 5, 2, 2, 5, 3, 2, 2, 3, 5, 2, 2, 29, 31, 2, 2, 5, 3, 2, 2, 3, 5, 2, 2, 5, 37, 2, 2, 7, 3, 2, 2
OFFSET
1,1
COMMENTS
The motivation is that n*(n+3)/2 = n + T(n), where T(n) = n*(n+1)/2 = A000217(n), the triangular numbers.
FORMULA
a(n) = A020639(A000096(n)). - Michel Marcus, Oct 28 2019
EXAMPLE
For n = 5, n + T(n) = 5 + 15 = 20. The smallest prime factor of 20 is 2, so a(5) = 2.
MATHEMATICA
Array[FactorInteger[# (# + 3)/2][[1, 1]] &, 77] (* Amiram Eldar, Nov 02 2019 *)
PROG
(PARI) A328823(n)=A020639(n*(n+3)/2) \\ M. F. Hasler, Nov 10 2019
CROSSREFS
Cf. A000096 (n + T(n)), A000217 (triangular numbers), A020639 (smallest prime factor).
Sequence in context: A159897 A019709 A076840 * A364143 A346265 A188923
KEYWORD
nonn
AUTHOR
Ali Sada, Oct 28 2019
EXTENSIONS
Simpler definition from M. F. Hasler, Nov 10 2019
STATUS
approved