Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034893
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034893 Maximum of different products of partitions of n into distinct parts. +0
3
1, 2, 3, 4, 6, 8, 12, 15, 24, 30, 40, 60, 72, 120, 144, 180, 240, 360, 420, 720, 840, 1008, 1260, 1680, 2520, 2880, 5040, 5760, 6720, 8064, 10080, 13440, 20160, 22680, 40320, 45360, 51840, 60480, 72576, 90720, 120960, 181440, 201600, 362880, 403200 (list; graph; listen)
OFFSET

1,2

REFERENCES

Tomislav Doslic, Maximum Product Over Partitions Into Distinct Parts, Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.8.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

Tomislav Doslic, Maximum product over partitions into distinct parts, J. of Integer Sequences, Vol. 8 (2005), Article 05.5.8.

CROSSREFS

Cf. A000792.

Sequence in context: A114312 A095041 A081029 this_sequence A018662 A048874 A092824

Adjacent sequences: A034890 A034891 A034892 this_sequence A034894 A034895 A034896

KEYWORD

nonn,nice

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu)

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