|
Search: id:A090490
|
|
|
| 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
|
|
| 1, 110, 11100, 1111000, 111110000, 11111100000, 1111111000006, 111111110000064, 11111111100000648, 1111111111000006480, 111111111110000064800, 11111111111100000648000, 1111111111111000006480005, 111111111111110000064800052, 11111111111111100000648000525
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sequence has 15 terms. No multiple of 16 can be obtained in this way from a(15). - David Wasserman (wasserma(AT)spawar.navy.mil), Dec 06 2005
|
|
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: A135645 A058935 A109241 this_sequence A135650 A097580 A139478
Adjacent sequences: A090487 A090488 A090489 this_sequence A090491 A090492 A090493
|
|
KEYWORD
|
base,nonn,easy,fini,full
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 03 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Dec 06 2005
|
|
|
Search completed in 0.002 seconds
|
