This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A284103 a(n) = Sum_{d|n, d=4 mod 5} d. 9
 0, 0, 0, 4, 0, 0, 0, 4, 9, 0, 0, 4, 0, 14, 0, 4, 0, 9, 19, 4, 0, 0, 0, 28, 0, 0, 9, 18, 29, 0, 0, 4, 0, 34, 0, 13, 0, 19, 39, 4, 0, 14, 0, 48, 9, 0, 0, 28, 49, 0, 0, 4, 0, 63, 0, 18, 19, 29, 59, 4, 0, 0, 9, 68, 0, 0, 0, 38, 69, 14, 0, 37, 0, 74, 0, 23, 0, 39, 79 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 FORMULA G.f.: Sum_{k>=1} (5*k - 1)*x^(5*k-1)/(1 - x^(5*k-1)). - Ilya Gutkovskiy, Mar 21 2017 MATHEMATICA Table[Sum[If[Mod[d, 5] == 4, d, 0], {d, Divisors[n]}], {n, 79}] (* Indranil Ghosh, Mar 21 2017 *) PROG (PARI) for(n=1, 79, print1(sumdiv(n, d, if(Mod(d, 5)==4, d, 0)), ", ")) \\ Indranil Ghosh, Mar 21 2017 (Python) from sympy import divisors def a(n): return sum([d for d in divisors(n) if d%5==4]) # Indranil Ghosh, Mar 21 2017 CROSSREFS Cf. A109700. Cf. Sum_{d|n, d=k-1 mod k} d: A000593 (k=2), A078182 (k=3), A050452 (k=4), this sequence (k=5), A284104 (k=6), A284105 (k=7). Sequence in context: A265397 A071327 A071326 * A151674 A297968 A243000 Adjacent sequences:  A284100 A284101 A284102 * A284104 A284105 A284106 KEYWORD nonn AUTHOR Seiichi Manyama, Mar 20 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 January 16 23:44 EST 2019. Contains 319206 sequences. (Running on oeis4.)