Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057338
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057338 Occurrences of most frequently occurring number in 1-to-n multiplication cube. +0
8
1, 3, 6, 9, 9, 15, 15, 21, 24, 24, 24, 36, 36, 36, 48, 51, 51, 57, 57, 75, 75, 75, 75, 90, 90, 90, 90, 90, 90, 114, 114, 114, 114, 114, 126, 138, 138, 138, 138, 156, 156, 180, 180, 180, 198, 198, 198, 207, 207, 207, 207, 207, 207, 207, 207, 237, 237, 237, 237, 267 (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. They occur 15 times, so a(7) = 15.

CROSSREFS

Cf. A057142, A057339, A057340, A057341, A057344.

Sequence in context: A011383 A007844 A159785 this_sequence A077856 A074499 A081605

Adjacent sequences: A057335 A057336 A057337 this_sequence A057339 A057340 A057341

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research