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.

A293516 a(n) = phi(n) - 2*phi(phi(n)), where phi = Euler totient function, A000010.

Original entry on oeis.org

-1, -1, 0, 0, 0, 0, 2, 0, 2, 0, 2, 0, 4, 2, 0, 0, 0, 2, 6, 0, 4, 2, 2, 0, 4, 4, 6, 4, 4, 0, 14, 0, 4, 0, 8, 4, 12, 6, 8, 0, 8, 4, 18, 4, 8, 2, 2, 0, 18, 4, 0, 8, 4, 6, 8, 8, 12, 4, 2, 0, 28, 14, 12, 0, 16, 4, 26, 0, 4, 8, 22, 8, 24, 12, 8, 12, 28, 8, 30, 0, 18, 8, 2, 8, 0, 18, 8, 8, 8, 8, 24, 4, 28, 2, 24, 0, 32
Offset: 1

Views

Author

Antti Karttunen, Nov 27 2017

Keywords

Crossrefs

Cf. A003401 (gives the positions of zeros after the two initial -1's).

Programs

  • PARI
    A293516(n) = (eulerphi(n) - 2*eulerphi(eulerphi(n)));

Formula

a(n) = A000010(n) - 2*A010554(n).
a(n) = A070556(n) - A010554(n).
a(n) = -A083254(A000010(n)).