id:A080436 - OEIS Search Results

Search: id:A080436

Displaying 1-1 of 1 results found.

page 1

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.

+0
5

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; listen)

	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 this_sequence A135295 A122625 A056544` `Adjacent sequences: A080433 A080434 A080435 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research