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!)
A086332 Least highly composite number having n distinct prime factors. 4

%I #28 May 12 2020 09:45:39

%S 2,6,60,840,27720,720720,36756720,698377680,64250746560,9316358251200,

%T 288807105787200,74801040398884800,3066842656354276800,

%U 131874234223233902400,18594267025475980238400,985496152350226952635200

%N Least highly composite number having n distinct prime factors.

%C The link from Flammenkamp includes factorizations of the first 43 terms.

%C Record values of A022404: a(n) = A022404(A008578(n)). [_Reinhard Zumkeller_, Jun 21 2010]

%H Amiram Eldar, <a href="/A086332/b086332.txt">Table of n, a(n) for n = 1..335</a> (terms 1..38 from Vladimir Letsko)

%H Achim Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/highly.txt">First 1200 highly composite numbers</a>

%H Vladimir Letsko, <a href="http://www-old.fizmat.vspu.ru/doku.php?id=marathon:problem_181">Mathematical Marathon, Problem 181</a> (in Russian).

%Y Cf. A002182.

%K nonn

%O 1,1

%A _Lekraj Beedassy_, Sep 01 2003

%E More terms from _David Wasserman_, Feb 28 2005

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 September 1 15:28 EDT 2024. Contains 375591 sequences. (Running on oeis4.)