login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057144 Smallest of the most frequently occurring numbers in 1-to-n multiplication table. 8
1, 2, 2, 4, 4, 6, 6, 6, 6, 6, 6, 12, 12, 12, 12, 12, 12, 36, 36, 60, 60, 60, 60, 24, 24, 24, 24, 24, 24, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120 (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(10), the most frequently occurring numbers are 6, 8, 10, 12, 18, 20, 24, 30,40, each occurring 4 times. The smallest of these numbers is 6, so a(10) = 6.

CROSSREFS

Cf. A057142, A057143, A057338.

Sequence in context: A109874 A069345 A007730 * A198332 A080606 A083535

Adjacent sequences:  A057141 A057142 A057143 * A057145 A057146 A057147

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 17:00 EST 2012. Contains 205637 sequences.