cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A086332 Least highly composite number having n distinct prime factors.

This page as a plain text file.
%I A086332 #28 May 12 2020 09:45:39
%S A086332 2,6,60,840,27720,720720,36756720,698377680,64250746560,9316358251200,
%T A086332 288807105787200,74801040398884800,3066842656354276800,
%U A086332 131874234223233902400,18594267025475980238400,985496152350226952635200
%N A086332 Least highly composite number having n distinct prime factors.
%C A086332 The link from Flammenkamp includes factorizations of the first 43 terms.
%C A086332 Record values of A022404: a(n) = A022404(A008578(n)). [_Reinhard Zumkeller_, Jun 21 2010]
%H A086332 Amiram Eldar, <a href="/A086332/b086332.txt">Table of n, a(n) for n = 1..335</a> (terms 1..38 from Vladimir Letsko)
%H A086332 Achim Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/highly.txt">First 1200 highly composite numbers</a>
%H A086332 Vladimir Letsko, <a href="http://www-old.fizmat.vspu.ru/doku.php?id=marathon:problem_181">Mathematical Marathon, Problem 181</a> (in Russian).
%Y A086332 Cf. A002182.
%K A086332 nonn
%O A086332 1,1
%A A086332 _Lekraj Beedassy_, Sep 01 2003
%E A086332 More terms from _David Wasserman_, Feb 28 2005