|
Search: id:A143986
|
|
|
| A143986 |
|
Smallest number d so that the smallest number with d divisors is a multiple of n. |
|
+0
1
|
|
| 1, 2, 4, 3, 12, 4, 32, 5, 9, 12, 96, 6, 240, 32, 12, 5, 640, 9, 1280, 12, 32, 96
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(5) = 12 because the smallest number with 12 divisors (60) is a multiple of 5. a(5) cannot be 8 because 24, which is not a multiple of 5, is the smallest number with 8 divisors.
|
|
CROSSREFS
|
Cf. A005179. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 02 2008]
Sequence in context: A014664 A093839 A096780 this_sequence A059662 A114883 A125091
Adjacent sequences: A143983 A143984 A143985 this_sequence A143987 A143988 A143989
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
J. Lowell (jhbubby(AT)mindspring.com), Sep 06 2008
|
|
EXTENSIONS
|
a(7) to a(22) from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 02 2008
|
|
|
Search completed in 0.002 seconds
|
