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 A343513 #11 Apr 19 2021 12:48:32
%S A343513 1,2,10,30,101,137,442,526,1063,1202,3026,1965,6085,4853,7310,8654,
%T A343513 18497,10100,29242,17630,29557,30857,64010,30397,77601,60842,89272,
%U A343513 71913,164837,60737,216226,139470,188165,180338,265142,152544,443557,282665,371134,275726,672401,251066,815410,461645
%N A343513 a(n) = Sum_{k=1..n} (k/gcd(n, k))^3.
%C A343513 a(n) = 1+n^2*(n-1)^2/4 if n is prime. - _Robert Israel_, Apr 19 2021
%H A343513 Robert Israel, <a href="/A343513/b343513.txt">Table of n, a(n) for n = 1..10000</a>
%F A343513 a(n) = Sum_{d|n} A053819(d).
%p A343513 f:= proc(n) local k;
%p A343513 add((k/igcd(n,k))^3,k=1..n)
%p A343513 end proc:
%p A343513 map(f, [$1..100]); # _Robert Israel_, Apr 19 2021
%t A343513 Table[Sum[(k/GCD[n, k])^3, {k, 1, n}], {n, 1, 44}]
%o A343513 (PARI) a(n) = sum(k=1, n, (k/gcd(n, k))^3); \\ _Michel Marcus_, Apr 17 2021
%Y A343513 Cf. A053819, A057661, A332654, A343497, A343514.
%K A343513 nonn
%O A343513 1,2
%A A343513 _Ilya Gutkovskiy_, Apr 17 2021