This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A260263 a(n+1) = a(n) + largest digit not in a(n), starting with a(1) = 1. 3
 1, 10, 19, 27, 36, 45, 54, 63, 72, 81, 90, 98, 105, 114, 123, 132, 141, 150, 159, 167, 176, 185, 194, 202, 211, 220, 229, 237, 246, 255, 264, 273, 282, 291, 299, 307, 316, 325, 334, 343, 352, 361, 370, 379, 387, 396, 404, 413, 422, 431, 440, 449, 457, 466, 475 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS From a(16173532) = 123456798 on, the sequence becomes constant. From a(324) = 2796 + 8 = 2804 on, this sequence becomes equal to sequence A260264, which has the same definition except for starting with a(0)=0. a(10^k): 1, 81, 870, 8598, 84284, 823330, 8010205, 77737463. - Robert G. Wilson v, Jul 21 2015 LINKS M. F. Hasler, Table of n, a(n) for n = 1..1000 E. Angelini, Add the biggest absent digit, SeqFan list, Jul 21,2015 MAPLE a[1]:= 1: for n from 2 to 100 do   a[n]:= a[n-1] + max({\$1..9} minus convert(convert(a[n-1], base, 10), set)); od: seq(a[n], n=1..100); # Robert Israel, Jul 22 2015 MATHEMATICA a[n_] := a[n] = a[n - 1] + Max[ Complement[ Range[9], IntegerDigits[ a[n - 1]] ]]; a[1] = 1; Array[a, 55] (* Robert G. Wilson v, Jul 21 2015 *) PROG (PARI) {a=1; d=vector(9, d, d); for(n=1, 100, print1(a", "); a+=vecmax(setminus(d, Set(digits(a)))))} CROSSREFS Cf. A045844. Sequence in context: A173231 A172055 A249648 * A044053 A044434 A098750 Adjacent sequences:  A260260 A260261 A260262 * A260264 A260265 A260266 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.

Last modified October 14 08:54 EDT 2019. Contains 327995 sequences. (Running on oeis4.)