login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260264 a(n+1) = a(n) + largest digit not in a(n), starting with a(0) = 0. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

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

MATHEMATICA

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

PROG

(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).

CROSSREFS

Cf. A045844.

Sequence in context: A271186 A253705 A056233 * A126623 A235361 A109333

Adjacent sequences:  A260261 A260262 A260263 * A260265 A260266 A260267

KEYWORD

nonn,base

AUTHOR

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

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 22:20 EDT 2019. Contains 327252 sequences. (Running on oeis4.)