|
Search: id:A061300
|
|
|
| A061300 |
|
Least number such that number of divisors is n!. |
|
+0
3
|
|
| 1, 1, 2, 12, 360, 55440, 61261200, 293318625600, 6064949221531200, 1315675499575984747200, 1130066578473302698988760000, 8029566026151577210973143393920000
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(n) = A037019(n!) for all n <= 12 except 4. I conjecture that this remains true for all larger n, i.e. 4! is the only "exceptional" factorial (see A037019). - David Wasserman (wasserma(AT)spawar.navy.mil), Jun 13 2002
Alternate definition: smallest number with same number of divisors as A006939 - J. Lowell (jhbubby(AT)mindspring.com), May 20 2008
|
|
FORMULA
|
A005179(n!)=a(n), for example A005179(120)=55440
a(n)=Min{x| A000005[x]=n!}, for example A000005(55440)=120 and 55440 is minimal.
|
|
EXAMPLE
|
a(3) = 12 and tau(12) = 6 = 3!
|
|
CROSSREFS
|
Cf. A000005, A005179, A007304, A006939, A037019, A000142, A072066, A009287.
Cf. A140635.
Sequence in context: A012724 A012624 A061307 this_sequence A079264 A006939 A152686
Adjacent sequences: A061297 A061298 A061299 this_sequence A061301 A061302 A061303
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com) and Labos E. (labos(AT)ana.sote.hu), Apr 26 2001
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 13 2002
|
|
|
Search completed in 0.002 seconds
|
