|
Search: id:A091916
|
|
|
| A091916 |
|
Maximum of odd products of partitions of n. |
|
+0
2
|
|
| 1, 1, 3, 3, 5, 9, 9, 15, 27, 27, 45, 81, 81, 135, 243, 243, 405, 729, 729, 1215, 2187, 2187, 3645, 6561, 6561, 10935, 19683, 19683, 32805, 59049, 59049, 98415, 177147, 177147, 295245, 531441, 531441, 885735, 1594323, 1594323, 2657205, 4782969, 4782969
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
For n>5, a(n+3) = 3a(n) (conjectured). - R. 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 odd product is 5.
|
|
MATHEMATICA
|
first Needs["DiscreteMath`Combinatorica`"], then f[n_] := Max[ Select[ Apply[ Times, Partitions[n], 2], OddQ[ # ] &]]; Table[ f[n], {n, 1, 43}] (from Robert G. Wilson v Feb 12 2004)
|
|
CROSSREFS
|
Cf. A000792, A091915.
Sequence in context: A125960 A141584 A136791 this_sequence A102437 A072706 A117433
Adjacent sequences: A091913 A091914 A091915 this_sequence A091917 A091918 A091919
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Feb 12 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 12 2004
|
|
|
Search completed in 0.002 seconds
|
