This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A284446 #20 Nov 26 2023 06:34:43
%S A284446 0,0,0,0,5,0,0,0,0,5,0,12,0,0,5,0,0,0,19,5,0,0,0,12,5,26,0,0,0,5,0,0,
%T A284446 33,0,5,12,0,19,0,45,0,0,0,0,5,0,47,12,0,5,0,26,0,54,5,0,19,0,0,17,61,
%U A284446 0,0,0,5,33,0,68,0,5,0,12,0,0,80,19,0,26,0,45,0,82
%N A284446 a(n) = Sum_{d|n, d == 5 (mod 7)} d.
%H A284446 Robert Israel, <a href="/A284446/b284446.txt">Table of n, a(n) for n = 1..10000</a>
%F A284446 G.f.: Sum_{k>=0} (5+7k) x^(5+7k)/(1-x^(5+7k)). - _Robert Israel_, Mar 27 2017
%F A284446 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
%p A284446 f:= n -> convert(select(t -> t mod 7 = 5, numtheory:-divisors(n)),`+`):
%p A284446 map(f, [$1..1000]); # _Robert Israel_, Mar 27 2017
%t A284446 Table[DivisorSum[n, # &, Mod[#, 7] == 5 &], {n, 82}] (* _Giovanni Resta_, Mar 27 2017 *)
%o A284446 (PARI) for(n=1, 82, print1(sumdiv(n, d, if(Mod(d, 7)==5, d, 0)), ", ")) \\ _Indranil Ghosh_, Mar 27 2017
%Y A284446 Cf. A109707.
%Y A284446 Cf. Sum_{d|n, d == k (mod 7)} d: A284099 (k=1), A284443 (k=2), A284444 (k=3), A284445 (k=4), this sequence (k=5), A284105 (k=6).
%K A284446 nonn,easy
%O A284446 1,5
%A A284446 _Seiichi Manyama_, Mar 27 2017