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 A176762 #4 Mar 30 2012 17:31:29
%S A176762 1,10,13,23,19,7,356,4,2,11,15,5,3,14,45,36,6,112,269,15999
%N A176762 Smallest number that takes n steps to reach a cycle under iteration of sum-of-squares-of-digits map.
%F A176762 a(n) = minimum of either A001273(n) or A094406(n+3).
%t A176762 f[n_] := Plus @@ (IntegerDigits[n]^2); t = Table[0, {25}]; k = 1; While[k < 150000001, a = Length@ NestWhileList[f, k, UnsameQ@## &, All] - 1; If[a < 25 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]
%Y A176762 Cf. A001273, A094406, A045646, A003001.
%K A176762 nonn,base
%O A176762 0,2
%A A176762 _Robert G. Wilson v_, Apr 25 2010