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 #4 Dec 05 2013 19:55:59
%S 1,2,3,4,5,6,7,8,9,100,121,132,143,154,105,176,187,108,1159,200,231,
%T 242,253,264,225,286,297,2128,2059,300,341,352,363,374,315,396,3367,
%U 3078,3159,400,451,462,473,484,405,4186,4277,4128,4459,500,561,572,583,594
%N Smallest multiple of n obtained by inserting digits between every pair of digits of n. If n is a k-digit number then there are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.
%e a(18) = 108, but a(19) = 1159 requires two digits to be inserted. a(100) = 10000. a(111)= 10101. 10101= 111*91.
%Y Cf. A110734, A110735.
%K base,nonn
%O 1,2
%A _Amarnath Murthy_, Feb 21 2003
%E More terms from _Franklin T. Adams-Watters_, Sep 25 2006