cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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, 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, 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
Offset: 0

Views

Author

Alois P. Heinz, Jan 30 2025

Keywords

Comments

Different from A326307.

Examples

			a(101) = 3 because 101 is the 3rd nonnegative integer having its set of decimal digits: 10, 100, 101: {0,1}.
		

Crossrefs

Cf. A326307 (the same for multiset).

Programs

  • Maple
    p:= proc() 0 end:
    a:= proc(n) option remember; local t;
          t:= {convert(n, base, 10)[]}; p(t):= p(t)+1
        end:
    seq(a(n), n=0..105);
  • Python
    from collections import Counter
    from itertools import count, islice
    def agen(): # generator of terms
        digsetcount = Counter()
        for n in count(0):
            key = "".join(sorted(set(str(n))))
            digsetcount[key] += 1
            yield digsetcount[key]
    print(list(islice(agen(), 106))) # Michael S. Branicky, Jan 30 2025