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!)
 A057339 Largest of the most frequently occurring numbers in 1-to-n multiplication cube. 3
 1, 4, 6, 12, 20, 24, 24, 48, 72, 120, 120, 120, 120, 168, 120, 240, 240, 360, 360, 360, 360, 360, 360, 720, 720, 720, 720, 1008, 1008, 720, 720, 720, 720, 720, 1680, 2520, 2520, 2520, 2520, 1440, 1440, 2520, 2520, 2520, 2520, 2520, 2520, 5040, 5040, 5040 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE M(n) is the array in which m(x,y,z)=x*y*z for x = 1 to n, y = 1 to n and z = 1 to n. In M(7), the most frequently occurring numbers are 12 and 24, each occurring 15 times. The largest of these numbers is 24, so a(7) = 24. CROSSREFS Cf. A057143, A057338, A057342, A057345. Sequence in context: A063607 A306270 A045956 * A336552 A160856 A019445 Adjacent sequences:  A057336 A057337 A057338 * A057340 A057341 A057342 KEYWORD nonn AUTHOR Neil Fernandez, Aug 28 2000 EXTENSIONS More terms from David W. Wilson, Aug 28 2001 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 September 19 10:53 EDT 2021. Contains 347556 sequences. (Running on oeis4.)