|
%I #9 May 01 2013 21:13:45
%S 9,19,1129,311239,51222349,615233141559,91625324451669,
%T 111826344654689,14192737475762899,161112839485864738129,
%U 211132103114951065778149,202911521231341151167788169,3038119214314413513697108189,50461202193174145146107138219,80541232213214165166127148239
%N 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 For a Mathematica program, see A177360 (you have to slightly modify it) [From Jasper Mulder (jasper.mulder(AT)planet.nl), Jun 04 2010]
%H J. Mulder, <a href="/A177368/b177368.txt">Table of n, a(n) for n = 1..25000</a>
%e 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 Cf. A060857, A177359 - A177367
%K easy,nonn,base
%O 1,1
%A _Paolo P. Lava_ and _Giorgio Balzarotti_, May 10 2010
%E Terms corrected using values in b-file. - _N. J. A. Sloane_, Oct 05 2010
|
