[go: up one dir, main page]

login
Revision History for A061300 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Least number whose number of divisors is n!.
(history; published version)
#25 by Joerg Arndt at Wed Sep 06 01:11:35 EDT 2023
STATUS

reviewed

approved

#24 by Stefano Spezia at Wed Sep 06 01:08:04 EDT 2023
STATUS

proposed

reviewed

#23 by Jon E. Schoenfield at Tue Sep 05 22:28:23 EDT 2023
STATUS

editing

proposed

#22 by Jon E. Schoenfield at Tue Sep 05 22:28:14 EDT 2023
COMMENTS

Alternate definition: a(0)=1; for n >= 1, smallest number with same number of divisors as A006939(n-1). - J. Lowell, May 20 2008

Discussion
Tue Sep 05
22:28
Jon E. Schoenfield: I tried to correct the May 20 2008 Comments entry. Does this look right?
#21 by Jon E. Schoenfield at Tue Sep 05 22:27:09 EDT 2023
COMMENTS

Alternate definition: smallest number with same number of divisors as A006939(n-1). - J. Lowell, May 20 2008

#20 by Jon E. Schoenfield at Tue Sep 05 22:21:47 EDT 2023
COMMENTS

a(n) = A037019(n!) for all n <= 12 except for 4. I conjecture that this remains true for all larger n, i.e. , 4! is the only "exceptional" factorial (see A037019). - David Wasserman, Jun 13 2002

Alternate definition: smallest number with same number of divisors as A006939 . - J. Lowell, May 20 2008

FORMULA

a(n) = A005179(n!), ; for example , A005179(120)=55440.

a(n) = Min{x| A000005(x)=n!}, ; for example , A000005(55440)=120 and 55440 is minimal.

STATUS

approved

editing

#19 by OEIS Server at Tue Sep 05 22:16:11 EDT 2023
LINKS

Max Alekseyev, <a href="/A061300/b061300_1.txt">Table of n, a(n) for n = 0..30</a>

#18 by Alois P. Heinz at Tue Sep 05 22:16:11 EDT 2023
STATUS

proposed

approved

Discussion
Tue Sep 05
22:16
OEIS Server: Installed first b-file as b061300.txt.
#17 by Max Alekseyev at Tue Sep 05 19:36:29 EDT 2023
STATUS

editing

proposed

#16 by Max Alekseyev at Tue Sep 05 19:36:20 EDT 2023
COMMENTS

Conjecture is confirmed for n <= 30. - Max Alekseyev, Sep 05 2023