The OEIS is supported by the many generous donors to the OEIS Foundation.

 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

%I

%S 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,

%T 24,24,16,32,16,28,24,24,32,36,18,24,24,36,18,40,18,32,36,24,18,40,30,

%U 36,32,36,20,40,40,48,32,24,20,48,24,32,48,42,40,48,24,40,36,48,24,60,24

%N a(n) = tau(n*A092988(n)); maximal value attained by the number of divisors of n*k, k < n.

%H Vincenzo Librandi, <a href="/A092989/b092989.txt">Table of n, a(n) for n = 2..2000</a>

%t 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 *)

%t Table[Max[DivisorSigma[0,n Range[n-1]]],{n,2,80}] (* _Harvey P. Dale_, Feb 23 2021 *)

%Y Cf. A092988.

%K nonn

%O 2,1

%A _Amarnath Murthy_, Mar 28 2004

%E 35 more terms from _Ryan Propper_, Jul 25 2005

%E More terms from _David Wasserman_, Aug 22 2006

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 January 29 23:01 EST 2023. Contains 359939 sequences. (Running on oeis4.)