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.
%I A225175 #15 Dec 07 2013 14:32:18 %S A225175 1,2,3,6,10,11,12,18,30,42,78,106,210,366,550,603,750,1290,2562,4398, %T A225175 4305,7470,9090,14322,24558,35382,55482,78020,141190,207519,301642, %U A225175 429870,552693,684846,1060710,1391390,2385246,3454044 %N A225175 Largest number which requires n iterations of the bi-unitary totient function (A116550) to reach 1. %C A225175 a(26) >= 55482. a(27) >= 78020. - _R. J. Mathar_, May 05 2013 %D A225175 M. Lal, H. Wareham and R. Mifflin, Iterates of the bi-unitary totient function, Utilitas Math., 10 (1976), 347-350. %Y A225175 Cf. A116550, A005424, A225176, A225174, A047994, A003271, A225172, A225173. %K A225175 nonn,more %O A225175 0,2 %A A225175 _N. J. A. Sloane_, May 01 2013 %E A225175 a(26)-a(37) from _Donovan Johnson_, Dec 07 2013