login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037025 a(1) = 8; a(n) = least k with d(k) = a(n-1), where d(k) is the number of divisors of k. 1
8, 24, 360, 3603600, 2549066103582535692163008000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Unless a(5) is an "exceptional" (or "extraordinary") number (see A072066), a(6) = 2^30 * 3^28 * 5^22 * 7^18 * 11^16 * 13^16 * 17^12 * 19^12 * 23^10 * 29^10 * 31^10 * 37^10 * 41^6 * 43^6 * 47^6 * 53^6 * 59^4 * 61^4 * 67^4 * 71^4 * 73^4 * 79^4 * 83^2 * 89^2 * 97^2 * 101^2 * 103^2 * 107^2 * 109^2 * 113^2 * 127^2 * 131^2 * 137 * 139 * 149 * 151 * 157 * 163 * 167 * 173 * 179 * 181 * 191 * 193 = 1.77955...*10^327 (a 328-digit number). - Jon E. Schoenfield, Sep 07 2023
LINKS
PROG
(PARI) lista(nn) = {a=8; print1(a, ", "); for (n=2, nn, k=1; while(numdiv(k) != a, k++); print1(k, ", "); a = k; ); } \\ Michel Marcus, Feb 17 2015
CROSSREFS
Sequence in context: A182589 A002268 A050893 * A105063 A274303 A132586
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
One more term from Naohiro Nomoto, Jun 28 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 15:04 EDT 2024. Contains 371914 sequences. (Running on oeis4.)