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 #8 Aug 21 2022 14:07:11
%S 3,12,108,1188,10692,117612,1058508,11643588,104792292,1152715212,
%T 10374436908,114118805988,1027069253892,11297761792812,
%U 101679856135308,1118478417488388,10066305757395492,110729363331350412
%N a(1) = 3, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).
%t ntm[n_]:=Module[{c=Ceiling[10^IntegerLength[n]/n]},If[c==10,n(c+1),c n]]; NestList[ ntm,3,20] (* _Harvey P. Dale_, Aug 21 2022 *)
%Y Cf. A080445, A080446, A080448, A080449, A080450, A080451, A080452, A080453.
%K base,nonn
%O 1,1
%A _Amarnath Murthy_, Feb 23 2003
%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003