|
|
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
|
|
|
EXAMPLE
|
a(8) = 111111110000064 is a multiple of 8 and is the concatenation of 1, a(7) and 4.
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn,easy,fini,full
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|