|
Search: id:A055492
|
|
|
| A055492 |
|
Numbers n such that LCM{1, ..., n} is a minimal number. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 16, 27, 28
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Minimal numbers (A007416): let A(h) = least positive integer having exactly h divisors, let d(n) = number of divisors of n; then n is minimal if A(d(n)) = n; i.e. if n is the least positive integer having the number of divisors it has.
Also the numbers n such that LCM (1, ..., n) is a highly composite number (A002182). - Matthew Vandermast (ghodges14(AT)comcast.net), Jul 12 2004
|
|
REFERENCES
|
M. E. Grost, The smallest number with a given number of divisors, Amer. Math. Monthly 75 (1968) 725-29.
J. Roberts, Lure of the Integers, Math. Assoc. of America, 1992, page 86.
|
|
CROSSREFS
|
Cf. A007416.
Cf. A003418, A095921.
Sequence in context: A130176 A156541 A031143 this_sequence A005459 A039216 A091208
Adjacent sequences: A055489 A055490 A055491 this_sequence A055493 A055494 A055495
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 05 2000
|
|
EXTENSIONS
|
Description corrected Feb 27 2003.
|
|
|
Search completed in 0.002 seconds
|
