cp's OEIS Frontend

A380706 n is the a(n)-th nonnegative integer having its set of decimal digits.

%I A380706 #13 Aug 07 2025 17:30:13
%S A380706 1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,1,1,1,2,2,2,
%T A380706 1,1,1,1,1,1,1,2,2,2,2,1,1,1,1,1,1,2,2,2,2,2,1,1,1,1,1,2,2,2,2,2,2,1,
%U A380706 1,1,1,2,2,2,2,2,2,2,1,1,1,2,2,2,2,2,2,2,2,1,1,2,2,2,2,2,2,2,2,2,2,3,1,1,1,1
%N A380706 n is the a(n)-th nonnegative integer having its set of decimal digits.
%C A380706 Different from A326307.
%H A380706 Alois P. Heinz, <a href="/A380706/b380706.txt">Table of n, a(n) for n = 0..65536</a>
%e A380706 a(101) = 3 because 101 is the 3rd nonnegative integer having its set of decimal digits: 10, 100, 101: {0,1}.
%p A380706 p:= proc() 0 end:
%p A380706 a:= proc(n) option remember; local t;
%p A380706       t:= {convert(n, base, 10)[]}; p(t):= p(t)+1
%p A380706     end:
%p A380706 seq(a(n), n=0..105);
%o A380706 (Python)
%o A380706 from collections import Counter
%o A380706 from itertools import count, islice
%o A380706 def agen(): # generator of terms
%o A380706     digsetcount = Counter()
%o A380706     for n in count(0):
%o A380706         key = "".join(sorted(set(str(n))))
%o A380706         digsetcount[key] += 1
%o A380706         yield digsetcount[key]
%o A380706 print(list(islice(agen(), 106))) # _Michael S. Branicky_, Jan 30 2025
%Y A380706 Cf. A326307 (the same for multiset).
%K A380706 nonn,look,base
%O A380706 0,12
%A A380706 _Alois P. Heinz_, Jan 30 2025