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 A175425 #10 Mar 30 2012 19:00:23
%S A175425 0,10,24,27,33
%N A175425 The smallest number m which needs n iterations of the map x->A175420(x) to reach a single-digit number.
%C A175425 Conjecture: sequence a(n) is finite for n = natural number, a(n) = 25 for n = infinity. See A175424.
%F A175425 a(n) = min {j : A175425(j) = n}.
%e A175425 a(4) = 33 because 33 is the smallest numbers with 4 steps of defined iteration: 3^3 = 27, 7^2 = 49, 9^4 = 6561, ((1^6)^5)^6 = 1.
%Y A175425 Cf. A175419 - A175427.
%K A175425 nonn,base
%O A175425 0,2
%A A175425 _Jaroslav Krizek_, May 09 2010