This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 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

%I

%S 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,

%T 40,42,44,45,47,49,51,53,55,56,58,60,62,64,66,67,69,71,73,75,77,78,80,

%U 82,84,86,88,89,91,93,95,97,99,100,102,105,108,111,112,114,116,118,120,123

%N a(n) = a(n-1) + number of distinct digits of a(n-1) in decimal representation, a(0)=0.

%C a(n) = a(n-1) + A043537(a(n-1)).

%t nxt[n_]:=n+Length[Select[DigitCount[n],#!=0&]]

%t Prepend[NestList[nxt,1,80],0] [From Harvey P. Dale, Dec. 26, 2010]

%K nonn,base

%O 0,3

%A _Reinhard Zumkeller_, May 25 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 January 20 02:48 EST 2019. Contains 319320 sequences. (Running on oeis4.)