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!)
 A057340 Smallest of the most frequently occurring numbers in 1-to-n multiplication cube. 3
 1, 2, 6, 12, 12, 12, 12, 24, 72, 60, 60, 72, 72, 72, 120, 240, 240, 180, 180, 360, 360, 360, 360, 720, 720, 720, 720, 720, 720, 720, 720, 720, 720, 720, 840, 2520, 2520, 2520, 2520, 1440, 1440, 2520, 2520, 2520, 2520, 2520, 2520, 5040, 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 smallest of these numbers is 12, so a(7) = 12. CROSSREFS Cf. A057144, A057338, A057343, A057346. Sequence in context: A130503 A278232 A074385 * A092427 A058198 A096075 Adjacent sequences:  A057337 A057338 A057339 * A057341 A057342 A057343 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 July 25 00:32 EDT 2021. Contains 346273 sequences. (Running on oeis4.)