login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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). 1

%I #2 Mar 30 2012 17:26:23

%S 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,

%T 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,

%U 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

%N a(1)=1, a(n)=maximal digit of sum a(1)+...+a(n-1).

%t a[1]=i=s=1;Do[i++;b=0+Max[IntegerDigits[s]];a[i]=b;s+=b,{225}] Table[a[k],{k,i}]

%Y Cf. A134548.

%K base,nonn

%O 1,3

%A _Zak Seidov_, Oct 31 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 23:40 EDT 2024. Contains 371798 sequences. (Running on oeis4.)