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 A033457 #28 Aug 03 2025 02:20:04
%S A033457 1,2,6,4,19,6,28,24,45,10,98,12,79,94,120,16,201,18,238,164,171,22,
%T A033457 436,120,229,234,426,28,695,30,496,352,369,370,1014,36,451,470,1068,
%U A033457 40,1261,42,946,1020,639,46,1832,336,1225,754,1278,52,1899,774,1924,920,981
%N A033457 GCD-convolution of squares A000290 with themselves.
%H A033457 Danny Rorabaugh, <a href="/A033457/b033457.txt">Table of n, a(n) for n = 0..10000</a>
%F A033457 a(n-2) = Sum_{d|n, d<n} d^2*phi(n/d). - _Vladeta Jovovic_, Aug 27 2003
%F A033457 From _Amiram Eldar_, Dec 06 2024: (Start)
%F A033457 a(n) = A069097(n+2) - (n+2)^2.
%F A033457 Sum_{k=1..n} a(k) ~ c * n^3, where c = (zeta(2)/zeta(3) - 1)/3 = (A306633 - 1)/3 = 0.122810925... . (End)
%t A033457 Table[Sum[d^2*EulerPhi[(n + 2)/d], {d, Most@ Divisors[n + 2]}], {n, 0, 47}] (* _Michael De Vlieger_, Mar 20 2015 *)
%t A033457 f[p_, e_] := p^(e - 1)*(p^e*(p + 1) - 1); a[n_] := Times @@ f @@@ FactorInteger[n + 2] - (n + 2)^2; Array[a, 100, 0] (* _Amiram Eldar_, Dec 06 2024 *)
%o A033457 (Sage) sum([d^2*euler_phi(int((n+2)/d)) for d in range(1,n+2) if (n+2)%d==0]) # _Danny Rorabaugh_, Mar 20 2015
%o A033457 (PARI) a(n) = {my(f = factor(n+2)); prod(i = 1, #f~, p = f[i,1]; e = f[i,2]; p^(e-1)*(p^e*(p+1) - 1)) - (n+2)^2;} \\ _Amiram Eldar_, Dec 06 2024
%Y A033457 Cf. A000010 (phi), A000290, A069097, A306633.
%K A033457 nonn,easy
%O A033457 0,2
%A A033457 _N. J. A. Sloane_