The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091915 Maximum of even products of partitions of n. 1
 0, 2, 2, 4, 6, 8, 12, 18, 24, 36, 54, 72, 108, 162, 216, 324, 486, 648, 972, 1458, 1944, 2916, 4374, 5832, 8748, 13122, 17496, 26244, 39366, 52488, 78732, 118098, 157464, 236196, 354294, 472392, 708588, 1062882, 1417176, 2125764, 3188646, 4251528 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA For n>6, a(n+3) = 3a(n) (conjectured). - Ralf Stephan, Dec 02 2004 EXAMPLE The partitions of 5 are 5, 41, 32, 311, 221, 2111, 11111, with products 5, 4, 6, 3, 4, 2, 1 and the maximal even product is 6. MATHEMATICA first Needs["DiscreteMath`Combinatorica`"], then f[n_] := Max[ Select[ Apply[ Times, Partitions[n], 2], EvenQ[ # ] &]]; Table[ f[n], {n, 1, 42}] (* Robert G. Wilson v, Feb 12 2004 *) Join[{0}, Table[Max[Select[Times@@@IntegerPartitions[n], EvenQ]], {n, 2, 50}]] (* Harvey P. Dale, Jan 17 2016 *) CROSSREFS Cf. A000792, A091916. Sequence in context: A078578 A323446 A018129 * A123862 A089647 A274152 Adjacent sequences:  A091912 A091913 A091914 * A091916 A091917 A091918 KEYWORD nonn AUTHOR Jon Perry, Feb 12 2004 EXTENSIONS More terms from Robert G. Wilson v, Feb 12 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 06:33 EST 2020. Contains 338678 sequences. (Running on oeis4.)