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.

A065552 a(n) = floor(sqrt(phi(10^n)*sigma(10^n) + 10^(3*n))).

Original entry on oeis.org

1, 32, 1004, 31637, 1000048, 31622932, 1000000496, 31622778176, 1000000004990, 31622776617479, 1000000000049975, 31622776601841868, 1000000000000499938, 31622776601685374362, 1000000000000004999847, 31622776601683809131135, 1000000000000000049999618, 31622776601683793478102215
Offset: 0

Views

Author

Labos Elemer, Nov 13 2001

Keywords

Comments

Similar results are obtained if the cube is replaced with other odd powers.

Crossrefs

Programs

  • Mathematica
    a[n_]:=Floor[Sqrt[EulerPhi[10^n]DivisorSigma[1,10^n]+10^(3n)]]; Array[a,17,0] (* Stefano Spezia, Mar 23 2023 *)

Extensions

a(0) = 1 prepended by, a(11)-a(15) corrected by, and a(16)-a(17) from Stefano Spezia, Mar 23 2023