login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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
11, 12, 13, 14, 15, 16, 17, 18, 19, 110, 122, 135, 149, 1514, 16711, 17141516, 1891314192026, 191819222327283739394147, 1101119202931333538404749576067707982919596100107 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..19.

EXAMPLE

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.

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

MATHEMATICA

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 *)

CROSSREFS

Cf. A110402.

Sequence in context: A308237 A347471 A162672 * A119247 A297269 A296710

Adjacent sequences:  A110400 A110401 A110402 * A110404 A110405 A110406

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy, Jul 29 2005

EXTENSIONS

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

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 03:43 EST 2021. Contains 349437 sequences. (Running on oeis4.)