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

%I

%S 1,2,6,12,12,12,12,24,72,60,60,72,72,72,120,240,240,180,180,360,360,

%T 360,360,720,720,720,720,720,720,720,720,720,720,720,840,2520,2520,

%U 2520,2520,1440,1440,2520,2520,2520,2520,2520,2520,5040,5040,5040,5040

%N Smallest of the most frequently occurring numbers in 1-to-n multiplication cube.

%e 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.

%Y Cf. A057144, A057338, A057343, A057346.

%K nonn

%O 1,2

%A _Neil Fernandez_, Aug 28 2000

%E More terms from _David W. Wilson_, Aug 28 2001

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 18 19:30 EDT 2021. Contains 347534 sequences. (Running on oeis4.)