|
%I #26 Jan 02 2023 12:30:51
%S 1,5,30,214,1865,22881,342447,6053444,123456798,2853116815,
%T 73686782411,2103299351346,65751519678065,2234152501943369,
%U 81985529216487165,3231407272993503256,136146740744970718253,6106233505124424781971,290464265927977839351196
%N In base n, a(n) is the largest (decimal equivalent) number reached when one sequentially adds to a sum, starting with zero, the largest digit not in that sum.
%H Hiroaki Yamanouchi, <a href="/A260351/b260351.txt">Table of n, a(n) for n = 2..22</a>
%H Frank Adams-Watters, <a href="http://list.seqfan.eu/oldermail/seqfan/2015-July/015118.html">Add the biggest absent digit</a>, SeqFan list, July 21, 2015
%e In base 4:
%e 0 + 3 = 3 (= 3)
%e 3 + 2 = 5 (= 11)
%e 5 + 3 = 8 (= 20)
%e 8 + 3 = 11 (= 23)
%e 11 + 1 = 12 (= 30)
%e 12 + 2 = 14 (= 32)
%e 14 + 1 = 15 (= 33)
%e 15 + 2 = 17 (= 101)
%e 17 + 3 = 20 (= 110)
%e 20 + 3 = 23 (= 113)
%e 23 + 2 = 25 (= 121)
%e 25 + 3 = 28 (= 130)
%e 28 + 2 = 30 (= 132)
%e 30 + 0 = 30 (repeat, therefore a(4) = 30)
%t Table[r=Range[0, b-1]; s=0; t=1; While[t!=0, t=Complement[r, IntegerDigits[s, b]][[-1]]; s=s+t]; s, {b, 2, 8}]
%o (Python)
%o from gmpy2 import digits
%o def A260351(n):
%o ....r, c = set([digits(d,n) for d in range(n)]), 0
%o ....dc = set(digits(c,n))
%o ....while len(dc) < n-1 or '0' in dc:
%o ........c += max([int(d,n) for d in r - dc])
%o ........dc = set(digits(c,n))
%o ....return c # _Chai Wah Wu_, Jul 24 2015
%Y Cf. A260263, A260264.
%K nonn,base
%O 2,2
%A _Hans Havermann_, Jul 23 2015
%E a(13) from _Giovanni Resta_, Jul 23 2015
%E a(14) from _Giovanni Resta_, Jul 24 2015
%E a(15)-a(20) from _Hiroaki Yamanouchi_, Aug 01 2015
|
