The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #2 Mar 30 2012 18:49:53
%S 1,2,10,20,102,103,104,112,113,123,124,134,135,136,137,140,204,205,
%T 215,216,226,234,237,245,250,260,406,416,417,425,427,428,429,436,446,
%U 450,470,480,507,508,568,569,579,580,590,600,607,608,618,628,629,639,649
%N Last digit d of a(n) is present in a(n+1+d); a(1)=1; a(n)<a(n+1)
%C If a(n) has no obligation to contain one or more digits, then a(n)=a(n-1)+1. Terms computed by Duncan Booth. The sequence arising when we drop a(n)<a(n+1) is A156819
%K base,easy,nonn
%O 1,2
%A _Eric Angelini_, Feb 16 2009