Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Oct 26 2019 18:02:24
%S 2,12,26,28,62,72,82,92,102,112,142,152,162,168,184,204,206,208,210,
%T 214,216,218,230,234,236,238,240,254,256,258,260,266,268,270,274,276,
%U 278,280,286,288,290,294,296,298,302,312,315,318,321,324,326,328,342,345
%N a(1) = 2; for n > 1, a(n) is the smallest number m greater than a(n-1) with a digit d > 1 occurring exactly once in decimal representations of m and a(n-1) and d = gcd(m, a(n-1)).
%C A098708(n) = gcd(a(n), a(n+1)).
%K nonn,base
%O 1,1
%A _Reinhard Zumkeller_, Sep 21 2004