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 #11 Mar 13 2018 04:58:27
%S 1,2,4,8,16,18,24,28,32,36,42,44,48,56,60,66,72,84,88,96,108,112,114,
%T 116,120,122,124,128,136,138,144,148,152,160,162,168,192,198,216,222,
%U 224,228,232,234,240,244,248,256,270,280,288,296,306,312,318,336,342
%N a(1) = 1; for n > 1, a(n) is the least number m > a(n-1) where m is a multiple of each nonzero decimal digit of a(n-1).
%C Equivalently, for n > 1, a(n) is the least multiple m > a(n-1) of lcm{d_i} where the d_i are the nonzero decimal digits of a(n-1).
%o (PARI) lista(nn) = {last = 1; print1(last, ", "); for (n=2, nn, lcmd = lcm(select(x->(x!=0), digits(last))); new = lcmd; while (new <= last, new += lcmd); print1(new, ", "); last = new;);} \\ _Michel Marcus_, Mar 13 2018
%K base,easy,nonn
%O 1,2
%A _Rick L. Shepherd_, Jan 07 2009