|
Search: id:A007416
|
|
|
| A007416 |
|
The minimal numbers: sequence A005179 arranged in increasing order.
(Formerly M1022)
|
|
+0
25
|
|
| 1, 2, 4, 6, 12, 16, 24, 36, 48, 60, 64, 120, 144, 180, 192, 240, 360, 576, 720, 840, 900, 960, 1024, 1260, 1296, 1680, 2520, 2880, 3072, 3600, 4096, 5040, 5184, 6300, 6480, 6720, 7560, 9216, 10080
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
n such there is no x<n such that A000005(x)=A000005(n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 28 2002
|
|
REFERENCES
|
M. E. Grost, The smallest number with a given number of divisors, Amer. Math. Monthly, 75 (1968), 725-729.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 86.
|
|
LINKS
|
T. D. Noe, Minimal numbers < 10^9, table of n, a(n) for n=1..266
|
|
PROGRAM
|
(PARI) for(s=1, 10^6, if(abs(prod(i=1, s-1, numdiv(i)-numdiv(s)))>0, print1(s, ", ")))
|
|
CROSSREFS
|
Cf. A099317, A099312, A099314, A099316, A099318.
Sequence in context: A089699 A089696 A099316 this_sequence A098895 A023995 A018189
Adjacent sequences: A007413 A007414 A007415 this_sequence A007417 A007418 A007419
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
