login

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”).

a(1) = 2; for n>1, a(n) = smallest multiple of n beginning with the least significant digit of a(n-1) > n and not divisible by 10 if n is not of the type 10k; otherwise a(n) ends in 0 and a(n+1) begins with the first nonzero digit from the right(LSD) of a(n).
0

%I #2 Dec 05 2013 19:55:59

%S 2,22,24,44,45,54,49,96,63,30,33,36,65,56,615,512,221,108,817,700,714,

%T 44,46,624,425,52,216

%N a(1) = 2; for n>1, a(n) = smallest multiple of n beginning with the least significant digit of a(n-1) > n and not divisible by 10 if n is not of the type 10k; otherwise a(n) ends in 0 and a(n+1) begins with the first nonzero digit from the right(LSD) of a(n).

%e a(9) = 63, a(10) = 30 and a(11) = 33 ( begins with 3); a(20) = 700 and a(21) = 714.

%K base,easy,nonn

%O 0,1

%A _Amarnath Murthy_, Feb 20 2003