Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057339
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057339 Largest of the most frequently occurring numbers in 1-to-n multiplication cube. +0
4
1, 4, 6, 12, 20, 24, 24, 48, 72, 120, 120, 120, 120, 168, 120, 240, 240, 360, 360, 360, 360, 360, 360, 720, 720, 720, 720, 1008, 1008, 720, 720, 720, 720, 720, 1680, 2520, 2520, 2520, 2520, 1440, 1440, 2520, 2520, 2520, 2520, 2520, 2520, 5040, 5040, 5040 (list; graph; listen)
OFFSET

1,2

EXAMPLE

M(n) is the array in which m(x,y,z)=x*y*z for x = 1 to n, y = 1 to n and z = 1 to n. In M(7), the most frequently occurring numbers are 12 and 24, each occurring 15 times. The largest of these numbers is 24, so a(7) = 24.

CROSSREFS

Cf. A057143, A057338, A057342, A057345.

Sequence in context: A087881 A063607 A045956 this_sequence A160856 A019445 A119638

Adjacent sequences: A057336 A057337 A057338 this_sequence A057340 A057341 A057342

KEYWORD

nonn

AUTHOR

N. Fernandez (primeness(AT)borve.org), Aug 28 2000

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net), Aug 28 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research