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 A103618 #17 Jul 27 2023 10:48:54 %S A103618 10,12,11,12,8,10,10,10,10,10,9,11,10,11,7,9,9,9,9,9,6,10,0,9,6,6,6,6, %T A103618 6,6,8,11,9,10,6,8,8,8,8,8,9,7,6,6,7,8,9,9,9,9,10,9,6,8,8,7,9,10,10, %U A103618 10,12,9,6,8,9,9,7,10,12,12,13,9,6,8,9,10,10,7,12,13,14,9,6,8,9,10,12,12,7,13 %N A103618 Number of steps required for n to reach a digit count invariant or cycle loop under the 'Look and Say' function A045918. %H A103618 Madras Math., <a href="http://www.madras.fife.sch.uk/departments/Mathematics/activities/descriptive%20numbers/descriptive8.html">Descriptive Numbers: Table of results</a> %e A103618 a(10)=9 because we have the 9-step chain 10 -> 1011 -> 1031 -> 102113 -> 103112113 -> 10411223 -> 1031221314 -> 1041222314 -> 1031321324 -> 1031223314, the latter being autobiographical, hence invariant. Also, a(40)=9 since we have the digit count iteration 40 -> 1014 -> 102114 -> 10311214 -> 1041121314 -> 1051121324 -> 104122131415 -> 105122132415 -> 104132131425 -> 104122232415 <-> 103142132415, ending in a 2-cycle loop. %Y A103618 Cf. A005151, A047841, A104785, A104786, A104787, A308781 (duplicate?). %K A103618 nonn,base %O A103618 1,1 %A A103618 _Lekraj Beedassy_, Mar 25 2005 %E A103618 Corrected and extended by _Sean A. Irvine_, Feb 08 2010