login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 4
1, 2, 3, 4, 5, 6, 7, 8, 9, 100, 121, 132, 143, 154, 105, 176, 187, 108, 1159, 200, 231, 242, 253, 264, 225, 286, 297, 2128, 2059, 300, 341, 352, 363, 374, 315, 396, 3367, 3078, 3159, 400, 451, 462, 473, 484, 405, 4186, 4277, 4128, 4459, 500, 561, 572, 583, 594 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

a(18) = 108, but a(19) = 1159 requires two digits to be inserted. a(100) = 10000. a(111)= 10101. 10101= 111*91.

CROSSREFS

Cf. A110734, A110735.

Sequence in context: A087019 A044911 A110734 * A135295 A122625 A056544

Adjacent sequences:  A080433 A080434 A080435 * A080437 A080438 A080439

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 21 2003

EXTENSIONS

More terms from Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Sep 25 2006

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 .

Last modified February 16 01:31 EST 2012. Contains 205860 sequences.