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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080501 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. 2
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; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..75.

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: A288069 A236175 A193813 * A122098 A115943 A122088

Adjacent sequences:  A080498 A080499 A080500 * A080502 A080503 A080504

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Mar 19 2003

EXTENSIONS

Corrected and extended by Ray Chandler, Oct 11 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 11:48 EDT 2019. Contains 328345 sequences. (Running on oeis4.)