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.

A225175 Largest number which requires n iterations of the bi-unitary totient function (A116550) to reach 1.

Original entry on oeis.org

1, 2, 3, 6, 10, 11, 12, 18, 30, 42, 78, 106, 210, 366, 550, 603, 750, 1290, 2562, 4398, 4305, 7470, 9090, 14322, 24558, 35382, 55482, 78020, 141190, 207519, 301642, 429870, 552693, 684846, 1060710, 1391390, 2385246, 3454044
Offset: 0

Views

Author

N. J. A. Sloane, May 01 2013

Keywords

Comments

a(26) >= 55482. a(27) >= 78020. - R. J. Mathar, May 05 2013

References

  • M. Lal, H. Wareham and R. Mifflin, Iterates of the bi-unitary totient function, Utilitas Math., 10 (1976), 347-350.

Crossrefs

Extensions

a(26)-a(37) from Donovan Johnson, Dec 07 2013