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.
A080436
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.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =4a(4) =5a(5) =6a(6) =7a(7) =8a(8) =9a(9) =100a(10) =121a(11) =132a(12) =143a(13) =154a(14) =105a(15) =176a(16) =187a(17) =108a(18) =1159a(19) =200a(20) =231a(21) =242a(22) =253a(23) =264a(24) =225a(25) =286a(26) =297a(27) =2128a(28) =2059a(29) =300
External references
- oeis: A080436