OFFSET
0,11
LINKS
Robert Israel, Table of n, a(n) for n = 0..10000
EXAMPLE
a(10) = 3 and the numbers m are: 0,1,10. a(14) = 7 with m = 1,4,10,11,12,13,14.
MAPLE
S:= Array(0..10000, n -> convert(convert(n, base, 10), set)):
f:= proc(n) nops(select(t -> S[t] intersect S[n] <> {}, [$0..n])) end proc:
map(f, [$0..100]); # Robert Israel, Dec 03 2024
PROG
(Python)
from collections import Counter
from itertools import count, islice
def agen(): # generator of terms
dig_sets = dict()
for n in count(0):
ss = set(str(n))
key = "".join(sorted(ss))
if key not in dig_sets:
dig_sets[key] = [ss, 0]
dig_sets[key][1] += 1
c = sum(dig_sets[k][1] for k in dig_sets if dig_sets[k][0]&ss)
yield c
print(list(islice(agen(), 77))) # Michael S. Branicky, Dec 03 2024
CROSSREFS
KEYWORD
AUTHOR
Amarnath Murthy, Feb 04 2003
EXTENSIONS
Corrected and extended by Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003
STATUS
approved
