|
Search: id:A057340
|
|
|
| A057340 |
|
Smallest of the most frequently occurring numbers in 1-to-n multiplication cube. |
|
+0
4
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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.
Adjacent sequences: A057337 A057338 A057339 this_sequence A057341 A057342 A057343
Sequence in context: A127698 A130503 A074385 this_sequence A092427 A058198 A096075
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. Fernandez (primeness(AT)borve.org), Aug 28 2000
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net), Aug 28 2001
|
|
|
Search completed in 0.002 seconds
|
