A260264 a(n+1) = a(n) + largest digit not in a(n), starting with a(0) = 0.

0, 9, 17, 26, 35, 44, 53, 62, 71, 80, 89, 96, 104, 113, 122, 131, 140, 149, 157, 166, 175, 184, 193, 201, 210, 219, 227, 236, 245, 254, 263, 272, 281, 290, 298, 305, 314, 323, 332, 341, 350, 359, 367, 376, 385, 394, 402, 411, 420, 429, 437, 446, 455, 464, 473, 482

Offset: 0

Author

Eric Angelini and M. F. Hasler, Jul 21 2015

Keywords

• nonn
• base

Comments

From a(16173532) = 123456798 on, the sequence becomes constant.

From a(324) = 2798 + 6 = 2804 on, this sequence becomes equal to sequence A260263, which has the same definition except for starting with a(1) = 1.

a(10^k) = 9, 89, 874, 8598, 84284, 823330, 8010205, 77737463, 123456798, ...

Links

• M. F. Hasler, Table of n, a(n) for n = 0..1000
• E. Angelini, Add the biggest absent digit, SeqFan list, Jul 21, 2015

Crossrefs

Cf. A045844.

Programs

Mathematica

NestList[#+Max[Complement[Range[0,9],IntegerDigits[#]]]&,0,60] (* Harvey P. Dale, May 17 2019 *)

PARI

{L=0;a=0;d=vector(9,d,d);for(n=0,1000,n>=L&&print1(a",")+L*=10;a+=vecmax(setminus(d,Set(digits(a)))))} \\ Set L=1 to list only a(10^k).