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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057142 Occurrences of most frequently occurring number in 1-to-n multiplication table. 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; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

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.

PROG

(Haskell)

import Data.List (group, sort)

a057142 n = head $ reverse $ sort $ map length $ group $

            sort [u * v | u <- [1..n], v <- [1..n]]

-- Reinhard Zumkeller, Jun 22 2013

CROSSREFS

Cf. A057143, A057144, A057338.

Sequence in context: A263089 A068509 A070319 * A098388 A157792 A171896

Adjacent sequences:  A057139 A057140 A057141 * A057143 A057144 A057145

KEYWORD

nonn

AUTHOR

Arran Fernandez, Aug 13 2000

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Apr 18 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 23:27 EST 2018. Contains 317221 sequences. (Running on oeis4.)