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!)
A192929 Least highly abundant number with n distinct prime factors. 1

%I #25 Jan 12 2016 08:58:46

%S 1,2,6,30,210,4620,120120,4084080,116396280,2677114440,310545275040,

%T 14440355289360,1068586291412640,114873026326858800,

%U 9419588158802421600,442720643463713815200,54011918502573085454400,8587895041909120587249600

%N Least highly abundant number with n distinct prime factors.

%C a(n) is the least number in sequence A002093, with A001221(a(n)) = n.

%D S. S. Pillai, Highly abundant numbers, Bull. Calcutta Math. Soc., 35, (1943), 141-156.

%H L. Alaoglu and P. Erdős, <a href="http://www.renyi.hu/~p_erdos/1944-03.pdf">On highly composite and similar numbers</a>, Trans. Amer. Math. Soc., 56 (1944), 448-469.

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Highly_abundant_number">Highly abundant number</a>

%Y Cf. A001222, A002093, A225194.

%K nonn

%O 0,2

%A _Enrique Pérez Herrero_, Jul 12 2011

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 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)