This site is supported by donations to The OEIS Foundation.



The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002497 Numbers N in A002809 such that there is rho > 0 such that for all A > 0, A008475(A)-A008475(N) >= rho*log(A/N).
(Formerly M2934 N1180)
3, 12, 60, 420, 4620, 60060, 180180, 360360, 6126120, 116396280, 2677114440, 77636318760, 2406725881560, 89048857617720, 3651003162326520 (list; graph; refs; listen; history; text; internal format)



What is the definition of this sequence? - Charles R Greathouse IV, Jan 12 2012

Note that A002182 is the sequence of highly composite numbers. - T. D. Noe, Jan 12 2012

The numbers contain the starred entries on pp. 187-190 of Nicolas. It is a subsequence of A002809 by selecting only elements of a set/property "G" (page 150). G contains all N such that a real, strictly positive rho exists such that for all strictly positive integers A we have l(A)-l(N) >= rho*log(A/N). The function l()=A008475() is defined on page 139. - R. J. Mathar, Mar 23 2012


N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


Table of n, a(n) for n=1..15.

J.-L. Nicolas, Ordre maximum d'un élément du groupe S(n) des permutations et "highly composite numbers", Bull. Soc. Math. Française 97 (1969), 129-191.


Sequence in context: A082278 A078162 A211774 * A228251 A218092 A192479

Adjacent sequences:  A002494 A002495 A002496 * A002498 A002499 A002500




N. J. A. Sloane.


Edited by M. F. Hasler, Mar 29 2015



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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 26 01:26 EDT 2017. Contains 287073 sequences.