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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090490 For n > 1, a(n) is the least multiple of n that can be obtained by adding one digit to each end of a(n-1). 0
1, 110, 11100, 1111000, 111110000, 11111100000, 1111111000006, 111111110000064, 11111111100000648, 1111111111000006480, 111111111110000064800, 11111111111100000648000, 1111111111111000006480005, 111111111111110000064800052, 11111111111111100000648000525 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Sequence has 15 terms. No multiple of 16 can be obtained in this way from a(15). - David Wasserman, Dec 06 2005

LINKS

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

EXAMPLE

a(8) = 111111110000064 is a multiple of 8 and is the concatenation of 1, a(7) and 4.

CROSSREFS

Cf. A078282.

Sequence in context: A266975 A265320 A109241 * A267688 A211979 A135650

Adjacent sequences:  A090487 A090488 A090489 * A090491 A090492 A090493

KEYWORD

base,nonn,easy,fini,full

AUTHOR

Amarnath Murthy, Dec 03 2003

EXTENSIONS

More terms from David Wasserman, Dec 06 2005

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 03:41 EST 2018. Contains 317252 sequences. (Running on oeis4.)