id:A057142 - OEIS Search Results

Search: id:A057142

Displaying 1-1 of 1 results found.

page 1

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

+0
8

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; listen)

	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 this_sequence A098388 A094235 A137397` `Adjacent sequences: A057139 A057140 A057141 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified September 5 19:27 EDT 2008. Contains 143485 sequences.

AT&T Labs Research