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

A378681
a(n) = denominator(Sum_{k=1..n} 1/P_2(k)), where P_2(k) = A087040(k) is the second largest prime dividing the k-th composite number.
2
2, 1, 2, 6, 3, 6, 3, 3, 6, 2, 1, 3, 6, 3, 15, 30, 30, 15, 5, 10, 30, 15, 15, 15, 30, 10, 5, 15, 30, 30, 15, 30, 210, 210, 70, 35, 105, 105, 210, 210, 105, 35, 70, 210, 105, 21, 21, 42, 14, 70, 210, 105, 105, 210, 210, 210, 105, 35, 70, 210, 210, 105, 105, 210
OFFSET
1,1
COMMENTS
See A378680 for more details.
LINKS
MATHEMATICA
p2[c_] := Module[{f = FactorInteger[c]}, If[f[[-1, 2]] > 1, f[[-1, 1]], f[[-2, 1]]]]; Denominator@ Accumulate[Table[1/p2[c], {c, Select[Range[50], CompositeQ]}]]
PROG
(PARI) lista(nmax) = {my(s = 0); forcomposite(n = 1, nmax, f = factor(n); s += if(f[#f~, 2] > 1, 1/f[#f~, 1], 1/f[#f~ - 1, 1]); print1(denominator(s), ", ")); }
CROSSREFS
Cf. A087039, A087040, A378680 (numerators).
Sequence in context: A099206 A269223 A121341 * A241737 A174959 A126093
KEYWORD
nonn,easy,frac,new
AUTHOR
Amiram Eldar, Dec 03 2024
STATUS
approved