OFFSET
1,2
LINKS
Robert Israel, Table of n, a(n) for n = 1..9999
MAPLE
N:= 100: count:= 0: R:= {$1..N}:
V:= Vector(N):
for n from 1 while count < N do
Q:= map(proc(t) local i; seq(t mod 10^i, i=1..1+ilog10(t)) end proc,
{seq(floor(n/10^i), i=0..ilog10(n))}) intersect R;
for m in Q do
V[m]:= V[m]+1;
if V[m] = m then A[m]:= n; count:= count+1 fi
od;
od:
seq(A[i], i=1..N); # Robert Israel, Sep 25 2019
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Jul 07 2002
EXTENSIONS
Corrected and extended by Robert Israel, Sep 25 2019
STATUS
approved