The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A363803 a(n) = Sum_{d|n, d == 0, 2, or 5 mod 7} d. 2
0, 2, 0, 2, 5, 2, 7, 2, 9, 7, 0, 14, 0, 23, 5, 18, 0, 11, 19, 7, 28, 2, 23, 14, 5, 28, 9, 51, 0, 37, 0, 18, 33, 2, 47, 23, 37, 21, 0, 47, 0, 86, 0, 46, 14, 25, 47, 30, 56, 7, 51, 28, 0, 65, 5, 107, 19, 60, 0, 49, 61, 2, 100, 18, 70, 35, 0, 70, 23, 133, 0, 95, 0, 39, 80, 21, 84, 28, 79, 63, 9, 84, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: Sum_{k>0, k == 0, 2 or 5 mod 7} k * x^k/(1 - x^k).
MATHEMATICA
a[n_] := DivisorSum[n, # &, MemberQ[{0, 2, 5}, Mod[#, 7]] &]; Array[a, 100] (* Amiram Eldar, Jun 23 2023 *)
PROG
(PARI) my(N=90, x='x+O('x^N)); concat(0, Vec(sum(k=1, N, [1, 0, 1, 0, 0, 1, 0][k%7+1]*k*x^k/(1-x^k))))
CROSSREFS
Cf. A363800.
Sequence in context: A005074 A161564 A078182 * A133394 A305628 A094721
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Jun 23 2023
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 21:33 EDT 2024. Contains 372533 sequences. (Running on oeis4.)