|
Search: id:A110402
|
|
|
| A110402 |
|
a(1) = 11; for n >= 1, a(n+1) is obtained by replacing the k-th digit of a(n) by the sum of all the less significant digits starting from the k-th digit. |
|
+0
2
|
|
| 11, 21, 31, 41, 51, 61, 71, 81, 91, 101, 211, 421, 731, 1141, 7651, 191261, 201910971, 3028282718171781, 666363615351434134332524171691, 11410810296938784787772696463595652514844413836312925241716101
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
After 211 the next term is obtained by replacing 2 by 2+1+1, 1 by 1+1 and retaining the least significant digit and it is 421.
|
|
CROSSREFS
|
Cf. A110403.
Sequence in context: A108812 A017281 A061589 this_sequence A081927 A139113 A109335
Adjacent sequences: A110399 A110400 A110401 this_sequence A110403 A110404 A110405
|
|
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), Mar 19 2006
|
|
|
Search completed in 0.002 seconds
|
