The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A328638 a(n) is the sum of m such that 2 <= m <= n and gpf(m) = gpf(n), where gpf(i) is the greatest prime factor of i (A006530), with a(1) = 1. 1
 1, 2, 3, 6, 5, 9, 7, 14, 18, 15, 11, 30, 13, 21, 30, 30, 17, 48, 19, 50, 42, 33, 23, 72, 75, 39, 99, 70, 29, 105, 31, 62, 66, 51, 105, 135, 37, 57, 78, 145, 41, 147, 43, 110, 190, 69, 47, 183, 196, 240, 102, 130, 53, 237, 165, 252, 114, 87, 59, 300 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For n >= 2, a(n) is the sum of the terms that precede n on the row, of the A125624 array, that contains n. LINKS Table of n, a(n) for n=1..60. EXAMPLE 5, 10, 15 and 20 have same gpf as 20, so a(20) = 5 + 10 + 15 + 20 = 50. PROG (PARI) gpf(n)={my(f=factor(n)[, 1]); f[#f]} a(n)={if(n<=1, n==1, my(t=gpf(n)); sum(i=2, n, if(gpf(i)==t, i, 0)))} \\ Andrew Howroyd, Oct 28 2019 CROSSREFS Cf. A006530 (gpf), A125624, A078899, A328637. Sequence in context: A035493 A363277 A070038 * A327420 A119790 A272214 Adjacent sequences: A328635 A328636 A328637 * A328639 A328640 A328641 KEYWORD nonn,easy AUTHOR J. Stauduhar, Oct 22 2019 STATUS approved

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

Last modified July 25 03:25 EDT 2024. Contains 374586 sequences. (Running on oeis4.)