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!)
A119823 a(n) = a(n-1) + number of distinct digits of a(n-1) in decimal representation, a(0)=0. 1
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 23, 25, 27, 29, 31, 33, 34, 36, 38, 40, 42, 44, 45, 47, 49, 51, 53, 55, 56, 58, 60, 62, 64, 66, 67, 69, 71, 73, 75, 77, 78, 80, 82, 84, 86, 88, 89, 91, 93, 95, 97, 99, 100, 102, 105, 108, 111, 112, 114, 116, 118, 120, 123 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = a(n-1) + A043537(a(n-1)).
MATHEMATICA
nxt[n_]:=n+Length[Select[DigitCount[n], #!=0&]]
Prepend[NestList[nxt, 1, 80], 0] (* Harvey P. Dale, Dec 26 2010 *)
CROSSREFS
Cf. A043537.
Sequence in context: A343160 A190760 A067036 * A172432 A317622 A331400
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, May 25 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)