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 A200747 #7 Nov 15 2012 22:28:22 %S A200747 0,1,2,2,3,1,2,2,3,3,3,2,3,3,3,3,4,3,3,3,4,4,2,1,2,2,3,3,3,2,3,3,3,3, %T A200747 4,3,3,3,4,4,2,3,4,4,2,2,3,2,3,3,3,3,4,3,3,3,4,4,2,3,4,4,2,2,3,4,2,2, %U A200747 3,3,3,3,3,3,4,4,2,3,4,4,2,2,3,4,2,2,3,3,3,2 %N A200747 Number of iterations of A034968 required to reach 1. %C A200747 a(n) = 1 when n is a factorial > 1. %H A200747 Alois P. Heinz, <a href="/A200747/b200747.txt">Table of n, a(n) for n = 1..10000</a> %o A200747 (PARI) a(n)=local(r);while(n>1,n=A034968(n);r++);r %Y A200747 Cf. A034968. %K A200747 nonn %O A200747 1,3 %A A200747 _Franklin T. Adams-Watters_, Nov 27 2011