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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A284152 a(n) = Sum_{d|n, d == 2 or 3 mod 5} d. 6
 0, 2, 3, 2, 0, 5, 7, 10, 3, 2, 0, 17, 13, 9, 3, 10, 17, 23, 0, 2, 10, 24, 23, 25, 0, 15, 30, 37, 0, 5, 0, 42, 36, 19, 7, 35, 37, 40, 16, 10, 0, 54, 43, 24, 3, 25, 47, 73, 7, 2, 20, 67, 53, 50, 0, 45, 60, 60, 0, 17, 0, 64, 73, 42, 13, 60, 67, 87, 26, 9, 0, 115, 73 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A000203(n) -5*A000203(n/5) -A284150(n), where A000203(.) =0 for non-integer arguments. - R. J. Mathar, Mar 21 2017 a(n) = A284280(n) + A284281(n). - Seiichi Manyama, Mar 24 2017 EXAMPLE Divisors of 12 are 1 2 3 4 6 12. And 2 == 12 mod 5. We get a(12) = 2 + 3 + 12 = 17. CROSSREFS Cf. A284280, A284281. Cf. A003106, A284150 (Sum_{d|n, d==1 or 4 mod 5} d). Sequence in context: A111182 A178142 A076427 * A011024 A105855 A152954 Adjacent sequences: A284149 A284150 A284151 * A284153 A284154 A284155 KEYWORD nonn AUTHOR Seiichi Manyama, Mar 21 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 26 15:01 EDT 2023. Contains 365660 sequences. (Running on oeis4.)