Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057345
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057345 Largest of the most frequently occurring numbers in 1-to-n 5-dimensional multiplication table. +0
4
1, 8, 36, 48, 120, 360, 840, 672, 864 (list; graph; listen)
OFFSET

1,2

EXAMPLE

M(n) is the array in which m(x,y,z,t,u)=x*y*z*t*u for x = 1 to n, y = 1 to n, z = 1 to n, t = 1 to n and u = 1 to n. In M(7), the most frequently occurring numbers are 360, 420, 504 and 840, each occurring 300 times. The largest of these numbers is 840, so a(7) = 840.

CROSSREFS

Cf. A057144, A057339, A057342, A057344.

Sequence in context: A000426 A089698 A133887 this_sequence A048740 A139608 A009923

Adjacent sequences: A057342 A057343 A057344 this_sequence A057346 A057347 A057348

KEYWORD

nonn

AUTHOR

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

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 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research