This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064683 Let n(s) be the number formed from n by inserting s 0's between each digit, e.g. 123(2) is 1002003; sequence gives numbers n such that n(s) is divisible by n for some s>0. 3
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 26, 27, 28, 29, 30, 31, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 77, 78, 79, 80, 81, 82, 83, 84, 85 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS If n=d(v)*10^v + d(v-1)*10^(v-1) .. + d(1)*10+d(0) then n(s) = d(v)*10^(v*(1+s))+d(v-1)*10^(v-1)*(1+s)+ .. + d(1)*10^(1+s)+d(0); e.g. 123(2) is 1*10^(2*3)+ 2*10^(1*3)+3*10^(0*3) = 1002003. LINKS EXAMPLE a(12) = 13 because 13(6) = 10,000,003 which is divisible by 13 CROSSREFS Cf. A064695, A064696, A064697, A064698. Sequence in context: A084176 A059389 A191328 * A084384 A119885 A007964 Adjacent sequences:  A064680 A064681 A064682 * A064684 A064685 A064686 KEYWORD base,nonn AUTHOR Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 10 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .