cp's OEIS Frontend

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

%I A260263 #21 Dec 23 2024 14:53:44
%S A260263 1,10,19,27,36,45,54,63,72,81,90,98,105,114,123,132,141,150,159,167,
%T A260263 176,185,194,202,211,220,229,237,246,255,264,273,282,291,299,307,316,
%U A260263 325,334,343,352,361,370,379,387,396,404,413,422,431,440,449,457,466,475
%N A260263 a(n+1) = a(n) + largest digit not in a(n), starting with a(1) = 1.
%C A260263 From a(16173532) = 123456798 on, the sequence becomes constant.
%C A260263 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.
%C A260263 a(10^k): 1, 81, 870, 8598, 84284, 823330, 8010205, 77737463. - _Robert G. Wilson v_, Jul 21 2015
%H A260263 M. F. Hasler, <a href="/A260263/b260263.txt">Table of n, a(n) for n = 1..1000</a>
%H A260263 E. Angelini, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2015-July/015110.html">Add the biggest absent digit</a>, SeqFan list, Jul 21,2015
%p A260263 a[1]:= 1:
%p A260263 for n from 2 to 100 do
%p A260263   a[n]:= a[n-1] + max({$1..9} minus convert(convert(a[n-1],base,10),set));
%p A260263 od:
%p A260263 seq(a[n],n=1..100); # _Robert Israel_, Jul 22 2015
%t A260263 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 *)
%o A260263 (PARI) {a=1;d=vector(9,d,d);for(n=1,100,print1(a",");a+=vecmax(setminus(d,Set(digits(a)))))}
%Y A260263 Cf. A045844.
%K A260263 nonn,base
%O A260263 1,2
%A A260263 _Eric Angelini_ and _M. F. Hasler_, Jul 21 2015