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 A348608 #21 Aug 21 2025 08:32:03
%S A348608 1,-1,1,1,1,-3,1,1,4,-3,1,-2,1,-3,4,5,1,-6,1,-3,4,-3,1,2,6,-3,4,-3,1,
%T A348608 -11,1,5,4,-3,6,0,1,-3,4,0,1,-12,1,-3,9,-3,1,8,8,-8,4,-3,1,-12,6,-2,4,
%U A348608 -3,1,-5,1,-3,11,13,6,-12,1,-3,4,-15,1,0,1,-3,9,-3,8,-12,1,8
%N A348608 a(n) = Sum_{d|n, d <= sqrt(n)} (-1)^(d + n/d) * d.
%H A348608 Antti Karttunen, <a href="/A348608/b348608.txt">Table of n, a(n) for n = 1..20000</a>
%F A348608 G.f.: Sum_{k>=1} k * x^(k^2) / (1 + x^k).
%F A348608 a(n) = 1 if n = 1 or n is an odd prime (A006005) or n = 4 or n = 8. - _Bernard Schott_, Dec 18 2021
%F A348608 a(n) = A037213(n) - A348953(n). - _Ridouane Oudra_, Aug 21 2025
%t A348608 Table[DivisorSum[n, (-1)^(# + n/#) # &, # <= Sqrt[n] &], {n, 1, 80}]
%t A348608 nmax = 80; CoefficientList[Series[Sum[k x^(k^2)/(1 + x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
%o A348608 (PARI) a(n) = sumdiv(n, d, if (d<=sqrt(n), (-1)^(d + n/d)*d)); \\ _Michel Marcus_, Oct 25 2021
%Y A348608 Cf. A000593, A006005, A046897, A066839, A109506, A305152, A333782, A037213, A348953.
%K A348608 sign,changed
%O A348608 1,6
%A A348608 _Ilya Gutkovskiy_, Oct 25 2021