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!)
A110403 To get a(m), replace each digit of a(m-1) with the sum of all digits to the left of that digit. 1

%I #5 Jan 17 2016 13:53:51

%S 11,12,13,14,15,16,17,18,19,110,122,135,149,1514,16711,17141516,

%T 1891314192026,191819222327283739394147,

%U 1101119202931333538404749576067707982919596100107

%N To get a(m), replace each digit of a(m-1) with the sum of all digits to the left of that digit.

%e After 122 the next term is obtained by replacing least significant 2 by 2+2+1, next 2 by 2+1 and retaining the most significant digit and it is 135.

%e After 122, the next term is found as 1, 1+2, 1+2+2, giving 135.

%t sdl[n_]:=With[{d=Table[Total[Take[IntegerDigits[n],i]],{i, IntegerLength[ n]}]},FromDigits[Flatten[IntegerDigits/@d]]]; NestList[sdl,11,20] (* _Harvey P. Dale_, Jan 17 2016 *)

%Y Cf. A110402.

%K base,easy,nonn

%O 1,1

%A _Amarnath Murthy_, Jul 29 2005

%E More terms from Michael J. Sell (mjs589(AT)psu.edu), Jan 30 2006

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 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)