login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A284443
a(n) = Sum_{d|n, d == 2 (mod 7)} d.
10
0, 2, 0, 2, 0, 2, 0, 2, 9, 2, 0, 2, 0, 2, 0, 18, 0, 11, 0, 2, 0, 2, 23, 2, 0, 2, 9, 2, 0, 32, 0, 18, 0, 2, 0, 11, 37, 2, 0, 2, 0, 2, 0, 46, 9, 25, 0, 18, 0, 2, 51, 2, 0, 11, 0, 2, 0, 60, 0, 32, 0, 2, 9, 18, 65, 2, 0, 2, 23, 2, 0, 83, 0, 39, 0, 2, 0, 2, 79, 18, 9
OFFSET
1,2
LINKS
FORMULA
G.f.: Sum_{k>=0} (7*k + 2)*x^(7*k+2)/(1 - x^(7*k+2)). - Ilya Gutkovskiy, Mar 28 2017
Sum_{k=1..n} a(k) = c * n^2 + O(n*log(n)), where c = Pi^2/84 = 0.117495... . - Amiram Eldar, Nov 26 2023
MATHEMATICA
Table[Sum[If[Mod[d, 7] == 2, d, 0], {d, Divisors[n]}], {n, 80}] (* Indranil Ghosh, Mar 27 2017 *)
PROG
(PARI) a(n) = sumdiv(n, d, d*((d % 7) == 2)); \\ Amiram Eldar, Nov 26 2023
CROSSREFS
Cf. A109704.
Cf. Sum_{d|n, d == k (mod 7)} d: A284099 (k=1), this sequence (k=2), A284444 (k=3), A284445 (k=4), A284446 (k=5), A284105 (k=6).
Sequence in context: A359287 A281009 A352446 * A260160 A008614 A036663
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Mar 27 2017
STATUS
approved