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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A272771 Smallest k in the interval [prime(n), 2*prime(n)], such that k has the maximal number of divisors in this interval. 3
 4, 6, 6, 12, 12, 24, 24, 36, 36, 48, 60, 60, 60, 60, 60, 60, 60, 120, 120, 120, 120, 120, 120, 120, 180, 180, 180, 180, 180, 180, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 360, 360, 360, 360, 360, 360 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecturally the different values of the sequence are highly composite numbers (A002182, n>=3). LINKS Peter J. C. Moses, Table of n, a(n) for n = 1..1000 EXAMPLE Let n=5, prime(n)=11. In interval [11,22] we have 3 numbers 12,18 and 20 with the  maximal number of divisors in this interval(6). Since 12 is the smallest of them, then a(5)=12. MATHEMATICA Table[Function[p, First@ FirstPosition[#, Max@ #] + p - 1 &@ Map[DivisorSigma[0, #] &, Range[p, 2 p]]]@ Prime@ n, {n, 80}] (* Michael De Vlieger, May 07 2016, Version 10 *) CROSSREFS Cf. A000005, A000040. Sequence in context: A304409 A081732 A079033 * A346675 A077038 A053320 Adjacent sequences:  A272768 A272769 A272770 * A272772 A272773 A272774 KEYWORD nonn AUTHOR Vladimir Shevelev, May 06 2016 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 December 4 13:29 EST 2021. Contains 349526 sequences. (Running on oeis4.)