Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085891
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085891 Maximal product of three numbers with sum n: a(n) = max(r*s*t), n = r+s+t. +0
1
1, 2, 4, 8, 12, 18, 27, 36, 48, 64, 80, 100, 125, 150, 180, 216, 252, 294, 343, 392, 448, 512, 576, 648, 729, 810, 900, 1000, 1100, 1210, 1331, 1452, 1584, 1728, 1872, 2028, 2197, 2366 (list; graph; listen)
OFFSET

3,2

COMMENT

Identical to A006501.

FORMULA

Same iteration as in A002620 (in two dimensions) but here in three dimensions: Index 0 (mod 3) terms are cubes and sequence pass from one cube to the next one extending successively each side by one unity: n^3, n^2(n+1), n(n+1)^2, (n+1)^3. - Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Dec 29 2005

EXAMPLE

a(13) = 80 = 4*4*5, another partition is 5,5,3 giving the product 75.

CROSSREFS

Cf. A002620.

Sequence in context: A007590 A080476 A053799 this_sequence A006501 A074633 A006500

Adjacent sequences: A085888 A085889 A085890 this_sequence A085892 A085893 A085894

KEYWORD

nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Jul 10 2003

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research