Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110403
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110403 To get a(m), replace each digit of a(m-1) with the sum of all digits to the left of that digit. +0
2
11, 12, 13, 14, 15, 16, 17, 18, 19, 110, 122, 135, 149, 1514, 16711, 17141516, 1891314192026, 191819222327283739394147, 1101119202931333538404749576067707982919596100107 (list; graph; listen)
OFFSET

1,1

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.

CROSSREFS

Cf. A110402.

Sequence in context: A162903 A038687 A070255 this_sequence A119247 A138595 A097932

Adjacent sequences: A110400 A110401 A110402 this_sequence A110404 A110405 A110406

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 29 2005

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research