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 A118511 #6 May 26 2014 23:48:48 %S A118511 1,0,0,0,0,0,0,0,0,0,18,17,15,13,11,9,7,5,3,1,16,16,15,13,11,9,7,5,3, %T A118511 1,14,14,14,13,11,9,7,5,3,1,12,12,12,12,11,9,7,5,3,1,10,10,10,10,10,9, %U A118511 7,5,3,1,8,8,8,8,8,8,7,5,3,1,6,6,6,6,6,6,6,5,3,1,4,4,4,4,4,4,4 %N A118511 Define sequence S_n by: initial term = n, reverse digits and add 1 to get next term. It is conjectured that S_n always reaches a cycle of length 9, as in A117230. Sequence gives number of steps for S_n to reach the cycle. %H A118511 N. J. A. Sloane and others, <a href="/wiki/Sequences_of_RADD_type">Sequences of RADD type</a>, OEIS wiki. %Y A118511 For records see A118510. Cf. A117831. S_1 is A117230, S_11 is A118512, S_13 is A118513. %K A118511 nonn,base %O A118511 1,11 %A A118511 _N. J. A. Sloane_, May 06 2006