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.

A066420 Least m such that card(invphi(phi(m)))=n.

Original entry on oeis.org

1, 3, 5, 15, 13, 51, 37, 41, 35, 65, 187, 397, 2269, 1059, 313, 73, 337, 247, 937, 185, 689, 1139, 2057, 403, 2827, 485, 323, 1321, 3697, 241, 769, 9001, 433, 7129, 4201, 527, 577, 1297, 1201, 15937, 3313, 3281, 3379, 949, 3121, 7519, 3889, 779, 1763
Offset: 2

Views

Author

Vladeta Jovovic, Dec 25 2001

Keywords

Crossrefs

Formula

a(n) = A049283(A007374(n)). - Max Alekseyev, Apr 12 2005

Extensions

More terms from Max Alekseyev, Apr 12 2005