Seqindignot sequence
Python 2, 92 91 89 88 bytes



a=()
i=0
exec"x=0\nwhile set(`x`)&amp;set(`i`)or x in a:x+=1\na+=x,;i+=1;"*-~input()
print a


Try it online!

Prints a list of the first n+1 numbers



Different approach, which is a lot faster:

Python 2, 96 bytes



n=input()
r=range(9*n)
i=0
exec"x=0\nwhile set(`r[x]`)&amp;set(`i`):x+=1\nprint r.pop(x),;i+=1;"*-~n


Try it online!