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 A118510 #8 May 26 2014 23:48:48 %S A118510 1,18,19,36,37,54,55,72,73 %N A118510 Define sequence S_m by: initial term = m, reverse digits and add 1 to get next term. It is conjectured that S_m always reaches a cycle of length 9, as in A117230. Sequence gives records for number of steps to reach cycle. %C A118510 The values of m which take this many steps are 1, 11, 101, 1001, 10001, 100001, 1000001, 10000001, 100000001, ... %H A118510 N. J. A. Sloane and others, <a href="/wiki/Sequences_of_RADD_type">Sequences of RADD type</a>, OEIS wiki. %F A118510 a(n) = 1 + 9*(n-1) for odd n; a(n) = 9*n for even n. Recursion: a(1) = 1; a(2) = 18; a(n+1) = a(n-1) + 18. - (Klaus Brockhaus, Jul 28 2006) %Y A118510 Records in A118511. %Y A118510 Cf. A117230, A117831, A118473, A118474. %K A118510 nonn,base %O A118510 1,2 %A A118510 _N. J. A. Sloane_, May 06 2006 %E A118510 a(5) to a(9) from _Klaus Brockhaus_, Jul 28 2006