A260263 a(n+1) = a(n) + largest digit not in a(n), starting with a(1) = 1.
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
Offset: 1
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
Crossrefs
Cf. A045844.
Programs
-
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 *)
-
PARI
{a=1;d=vector(9,d,d);for(n=1,100,print1(a",");a+=vecmax(setminus(d,Set(digits(a)))))}
Comments