A057142 - OEIS

This site is supported by donations to The OEIS Foundation.

A057142

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

1, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 16, 16, 16, 16, 16, 16, 16, 16 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	EXAMPLE	`M(n) is the array in which m(x,y)= x*y for x = 1 to n and y = 1 to n. In m(5), the most frequently occurring number is 4. It occurs 3 times, so a(5) = 3.`
	CROSSREFS	`Cf. A057143, A057144, A057338.` `Sequence in context: A122258 A068509 A070319 * A098388 A157792 A171896` `Adjacent sequences: A057139 A057140 A057141 * A057143 A057144 A057145`
	KEYWORD	`nonn`
	AUTHOR	`Arran Fernandez (arran(AT)borve.org), Aug 13 2000`
	EXTENSIONS	`More terms from Larry Reeves (larryr(AT)acm.org), Apr 18 2001`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:30 EST 2012. Contains 205907 sequences.