The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A309943 Numbers k such that k * d(k) > j * d(j) for all j < k, where d(k) is the number of divisors of k (A000005). 1
 1, 2, 3, 4, 6, 8, 10, 12, 16, 18, 20, 24, 30, 36, 42, 48, 60, 72, 84, 90, 96, 108, 120, 144, 168, 180, 210, 216, 240, 288, 300, 336, 360, 420, 480, 504, 540, 600, 630, 660, 672, 720, 840, 1008, 1080, 1200, 1260, 1440, 1680, 1980, 2016, 2100, 2160, 2520, 3120 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Differs from A002093 for n >= 41. Nicolas asks if there are infinitely many terms of this sequence that are not largely composite (A067128). LINKS Amiram Eldar, Table of n, a(n) for n = 1..457 Jean-Louis Nicolas, Nombres hautement composés, Acta Arithmetica, Vol. 49 (1988), pp. 395-412, alternative link. See p. 411. MATHEMATICA s = {}; dm = 0; Do[d1 = n * DivisorSigma[0, n]; If[d1 > dm, dm = d1; AppendTo[s, n]], {n, 1, 10^4}]; s CROSSREFS Cf. A000005, A002093, A038040, A067128. Sequence in context: A325796 A279029 A316886 * A002093 A179971 A067069 Adjacent sequences:  A309940 A309941 A309942 * A309944 A309945 A309946 KEYWORD nonn AUTHOR Amiram Eldar, Aug 24 2019 STATUS approved

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

Last modified July 29 17:13 EDT 2021. Contains 346346 sequences. (Running on oeis4.)