cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A372996 a(n) = Sum_{k=1..n} sigma_2( (n/gcd(k,n))^2 ).

Original entry on oeis.org

1, 22, 183, 704, 2605, 4026, 14707, 22548, 44469, 57310, 147631, 128832, 344773, 323554, 476715, 721596, 1340977, 978318, 2352295, 1833920, 2691381, 3247882, 6168163, 4126284, 8140625, 7585006, 10806147, 10353728, 19827445, 10487730, 27734491, 23091212, 27016473
Offset: 1

Views

Author

Seiichi Manyama, May 19 2024

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := DivisorSum[n, EulerPhi[#] * DivisorSigma[2, #^2] &]; Array[a, 100] (* Amiram Eldar, May 20 2024 *)
  • PARI
    a(n) = sumdiv(n, d, eulerphi(d)*sigma(d^2, 2));

Formula

a(n) = Sum_{d|n} phi(d) * sigma_2(d^2).
From Amiram Eldar, May 20 2024: (Start)
Multiplicative with a(p^e) = (p^(5*e+7) - p^(5*e+6) - p^(e+5) + p^e + p^6 - p^2) / ((p^2 - 1) * (p^5 - 1)).
Sum_{k=1..n} a(k) ~ c * n^6 / 6, where c = zeta(5) * zeta(6) * Product_{p prime} (1 - 1/p^2 + 1/p^3 - 1/p^4 - 1/p^6 + 1/p^7) = 0.71416166953252012639... . (End)

A373004 a(n) = Sum_{k=1..n} sigma( (n/gcd(k,n))^n ).

Original entry on oeis.org

1, 8, 81, 1054, 15625, 279936, 5764801, 134480378, 3486843447, 100000000000, 3138428376721, 107006262884442, 3937376385699289, 155568095557812224, 6568408355712890625, 295150156996346511346, 14063084452067724991009, 708235345964697414795264
Offset: 1

Views

Author

Seiichi Manyama, May 19 2024

Keywords

Crossrefs

Programs

  • PARI
    a(n) = sumdiv(n, d, eulerphi(d)*sigma(d^n));

Formula

If k is squarefree (cf. A005117) then a(k) = k^(k+1).
a(n) = Sum_{d|n} phi(d) * sigma(d^n).
Showing 1-2 of 2 results.