This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A132137 a(1)=1, a(n)=maximal digit of sum a(1)+...+a(n-1). 0
 1, 1, 2, 4, 8, 6, 2, 4, 8, 6, 4, 6, 5, 7, 6, 7, 7, 8, 9, 1, 2, 4, 8, 6, 2, 4, 8, 6, 4, 6, 5, 7, 6, 7, 7, 8, 9, 2, 3, 6, 2, 4, 8, 6, 3, 5, 4, 4, 8, 6, 6, 8, 7, 8, 9, 3, 3, 6, 3, 5, 3, 3, 6, 3, 5, 4, 4, 8, 6, 6, 8, 7, 8, 9, 4, 4, 8, 6, 4, 6, 4, 6, 4, 6, 5, 7, 6, 7, 7, 8, 9, 5, 6, 5, 7, 5, 9, 8, 6, 5, 7, 6, 7, 7, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS MATHEMATICA a[1]=i=s=1; Do[i++; b=0+Max[IntegerDigits[s]]; a[i]=b; s+=b, {225}] Table[a[k], {k, i}] CROSSREFS Cf. A134548. Sequence in context: A248573 A280426 A000689 * A011180 A103546 A321043 Adjacent sequences:  A132134 A132135 A132136 * A132138 A132139 A132140 KEYWORD base,nonn AUTHOR Zak Seidov, Oct 31 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 04:18 EST 2019. Contains 320371 sequences. (Running on oeis4.)