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 A177368 #11 Jun 02 2025 02:54:37 %S A177368 9,19,1129,311239,51222349,615233141559,91625324451669, %T A177368 111826344654689,14192737475762899,161112839485864738129, %U A177368 211132103114951065778149,202911521231341151167788169,3038119214314413513697108189,50461202193174145146107138219,80541232213214165166127148239 %N A177368 Count the digits of the previous terms and describe nonzero counts, digits in ascending order, concatenating the count and the digit. Initial term is 9. %C A177368 For a Mathematica program, see A177360 (you have to slightly modify it) [From Jasper Mulder (jasper.mulder(AT)planet.nl), Jun 04 2010] %H A177368 J. Mulder, <a href="/A177368/b177368.txt">Table of n, a(n) for n = 1..25000</a> %e A177368 Nine; one nine; 1129=one one, two nines; 311239=three ones, one two, three nines; 51222349=five ones, two twos, two threes, four nines; six ones, five twos, three threes, one four, one five, five nines; etc. %Y A177368 Cf. A060857, A177359 - A177367 %K A177368 easy,nonn,base %O A177368 1,1 %A A177368 _Paolo P. Lava_ and _Giorgio Balzarotti_, May 10 2010 %E A177368 Terms corrected using values in b-file. - _N. J. A. Sloane_, Oct 05 2010