cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A057346 Smallest of the most frequently occurring numbers in 1-to-n 5-dimensional multiplication table.

Original entry on oeis.org

1, 4, 12, 48, 120, 360, 360, 480, 864, 1440, 1440, 1440, 1440, 5040, 5040, 10080, 10080, 8640, 8640, 8640, 30240, 30240, 30240, 60480, 60480, 60480, 60480, 60480, 60480, 60480, 60480, 120960, 120960, 120960, 302400, 302400, 302400, 302400, 302400, 302400, 302400, 302400
Offset: 1

Views

Author

Neil Fernandez, Aug 28 2000

Keywords

Examples

			M(n) is the array in which m(x,y,z,t,u)=x*y*z*t*u for x = 1 to n, y = 1 to n, z = 1 to n, t = 1 to n and u = 1 to n. In M(7), the most frequently occurring numbers are 360, 420, 504 and 840, each occurring 300 times. The smallest of these numbers is 360, so a(7) = 360.
		

Crossrefs

Extensions

More terms from David A. Corneth, Apr 18 2022