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.

A057344 Occurrences of most frequently occurring number in 1-to-n 5-dimensional multiplication table.

Original entry on oeis.org

1, 10, 30, 95, 140, 300, 300, 480, 740, 1260, 1260, 2070, 2070, 2640, 3780, 4620, 4620, 5810, 5810, 7530, 10660, 10660, 10660, 13840, 13840, 13840, 15340, 20340, 20340, 25020, 25020, 28320, 28320, 28320, 32710, 40090, 40090, 40090, 40090, 49740, 49740, 58980
Offset: 1

Views

Author

Neil Fernandez, Aug 28 2000

Keywords

Examples

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

Crossrefs

Extensions

More terms from Sean A. Irvine, Jun 03 2022