id:A080501 - OEIS Search Results

Search: id:A080501

Displaying 1-1 of 1 results found.

page 1

Let f(n) be the smallest multiple of n that can be obtained by inserting digits anywhere in n except that f(n) is not equal to 10*n; a(n) = f(n)/n.

+0
3

11, 6, 11, 6, 3, 6, 11, 6, 11, 11, 11, 11, 11, 11, 7, 11, 11, 6, 61, 6, 11, 11, 11, 11, 5, 11, 11, 26, 71, 11, 11, 11, 11, 11, 9, 11, 83, 36, 61, 6, 11, 11, 11, 11, 9, 31, 31, 26, 51, 3, 11, 11, 11, 11, 21, 26, 89, 26, 27, 6, 11, 11, 11, 26, 21, 51, 25, 26, 39, 11, 11, 11, 51, 51, 5 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(1) = 12/1 = 12, a(18) = 198/18 = 11.` `a(1) = 11/1 = 11; a(15) = 105/15 = 7; a(18) = 108/18 = 6.`
	CROSSREFS	`Cf. A080502.` `Sequence in context: A038319 A002547 A090840 this_sequence A122098 A115943 A122088` `Adjacent sequences: A080498 A080499 A080500 this_sequence A080502 A080503 A080504`
	KEYWORD	`base,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 19 2003`
	EXTENSIONS	`Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 11 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research