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.

A353276 a(n) = phi(n) + tau(n)^omega(n) - sigma(n).

Original entry on oeis.org

1, 0, 0, -2, 0, 6, 0, -7, -4, 2, 0, 12, 0, -2, 0, -18, 0, 3, 0, 2, -4, -10, 0, 12, -8, -14, -18, -8, 0, 448, 0, -41, -12, -22, -8, 2, 0, -26, -16, -10, 0, 428, 0, -28, -18, -34, 0, -8, -12, -37, -24, -38, 0, -38, -16, -32, -28, -46, 0, 1576, 0, -50, -32, -88, -20, 388, 0, -58, -36, 392, 0, -27, 0, -62, -48, -68, -20, 368
Offset: 1

Views

Author

Antti Karttunen, Apr 27 2022

Keywords

Crossrefs

Cf. A110087 (positions of negative terms), A110086 (of terms >= 0), A110085 (of terms > 0).

Programs

  • Mathematica
    Array[#1 + #3^#2 - #4 & @@ Flatten@ {EulerPhi[#], PrimeNu[#], DivisorSigma[{0, 1}, #]} &, 78] (* Michael De Vlieger, Apr 27 2022 *)
  • PARI
    A353276(n) = (eulerphi(n) + (numdiv(n)^omega(n)) - sigma(n));

Formula

a(n) = A110088(n) - A051612(n) = A000010(n) + A000005(n)^A001221(n) - A000203(n).
a(p) = 0 for all primes p.