The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A280050 a(n) = Sum_{k=2..n} k/lpf(k), where lpf(k) is the least prime dividing k (A020639). 0
 0, 1, 2, 4, 5, 8, 9, 13, 16, 21, 22, 28, 29, 36, 41, 49, 50, 59, 60, 70, 77, 88, 89, 101, 106, 119, 128, 142, 143, 158, 159, 175, 186, 203, 210, 228, 229, 248, 261, 281, 282, 303, 304, 326, 341, 364, 365, 389, 396, 421, 438, 464, 465, 492, 503, 531, 550, 579, 580, 610, 611, 642, 663, 695, 708, 741, 742, 776, 799, 834, 835 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Sum of the largest proper divisors of all positive integers <= n. LINKS Eric Weisstein's World of Mathematics, Proper Divisor Eric Weisstein's World of Mathematics, Least Prime Factor FORMULA a(n) = Sum_{k=2..n} k/A020639(k). a(n) + 1 = Sum_{k=1..n} A032742(k). a(p^k) = a(p^k-1) + p^(k-1), for p is prime. EXAMPLE For n = 8 the divisors of the first eight positive integers are {1}, {1, 2}, {1, 3}, {1, 2, 4}, {1, 5}, {1, 2, 3, 6}, {1, 7}, {1, 2, 4, 8}, so a(8) = 1 + 1 + 2 + 1 + 3 + 1 + 4 = 13. MATHEMATICA Table[Sum[k/FactorInteger[k][[1, 1]], {k, 2, n}], {n, 71}] CROSSREFS Cf. A001065, A020639, A032742, A046669, A046670, A153485. Sequence in context: A064573 A065300 A080403 * A271392 A195364 A279793 Adjacent sequences:  A280047 A280048 A280049 * A280051 A280052 A280053 KEYWORD nonn,easy AUTHOR Ilya Gutkovskiy, Jan 02 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 7 19:49 EDT 2020. Contains 333306 sequences. (Running on oeis4.)