The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092989 a(n) = tau(n*A092988(n)); maximal value attained by the number of divisors of n*k, k < n. 2
 2, 4, 6, 6, 8, 8, 10, 12, 12, 8, 16, 12, 16, 18, 20, 12, 18, 12, 24, 24, 18, 12, 24, 24, 20, 24, 24, 16, 32, 16, 28, 24, 24, 32, 36, 18, 24, 24, 36, 18, 40, 18, 32, 36, 24, 18, 40, 30, 36, 32, 36, 20, 40, 40, 48, 32, 24, 20, 48, 24, 32, 48, 42, 40, 48, 24, 40, 36, 48, 24, 60, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 2..2000 MATHEMATICA Do[x = y = 0; For[k = 1, k < n, k++, d = Length[Divisors[n*k]]; If[d > x, x = d; y = k]]; Print[x], {n, 2, 50}] (* Ryan Propper, Jul 25 2005 *) Table[Max[DivisorSigma[0, n Range[n-1]]], {n, 2, 80}] (* Harvey P. Dale, Feb 23 2021 *) CROSSREFS Cf. A092988. Sequence in context: A128558 A090346 A267460 * A065558 A235384 A342597 Adjacent sequences: A092986 A092987 A092988 * A092990 A092991 A092992 KEYWORD nonn AUTHOR Amarnath Murthy, Mar 28 2004 EXTENSIONS 35 more terms from Ryan Propper, Jul 25 2005 More terms from David Wasserman, Aug 22 2006 STATUS approved

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.

Last modified November 29 18:13 EST 2022. Contains 358431 sequences. (Running on oeis4.)