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

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!)
 A110402 a(1) = 11; for n >= 1, a(n+1) is obtained by replacing the k-th digit of a(n) with the sum of all the less significant digits starting from the k-th digit. 1

%I

%S 11,21,31,41,51,61,71,81,91,101,211,421,731,1141,7651,191261,

%T 201910971,3028282718171781,666363615351434134332524171691,

%U 11410810296938784787772696463595652514844413836312925241716101

%N a(1) = 11; for n >= 1, a(n+1) is obtained by replacing the k-th digit of a(n) with the sum of all the less significant digits starting from the k-th digit.

%e After 211 the next term is obtained by replacing 2 with 2+1+1, 1 by 1+1 and retaining the least significant digit and it is 421.

%Y Cf. A110403.

%K base,easy,nonn

%O 1,1

%A _Amarnath Murthy_, Jul 29 2005

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

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.

Last modified December 6 01:46 EST 2021. Contains 349558 sequences. (Running on oeis4.)