|
Search: id:A140436
|
|
|
| A140436 |
|
a(n) is the maximum number of partitions of n with the same product. |
|
+0
1
|
|
| 1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 5, 5, 6, 7, 8, 9, 12, 12, 15, 16, 19, 21, 25, 27, 30, 33, 36, 40, 45, 49, 58, 63, 72, 79, 91, 100, 114, 127, 147, 163, 183, 204, 229, 252, 281, 311, 343, 378, 418, 469, 517, 571, 633, 692, 763, 830, 918, 999, 1087, 1189
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
There are two pairs of partitions of 6 that give the same product: the partitions {1,1,2,2} and {1,1,4} have product 4 and the partitions {2,2,2} and {2,4} have product 8. You can't find three different partitions of 6 that give the same product. Hence a(6) = 2.
|
|
MATHEMATICA
|
Table[Max[Transpose[Tally[Times @@@ IntegerPartitions[n]]][[2]]], {n, 60}]
|
|
CROSSREFS
|
Sequence in context: A018050 A116492 A103263 this_sequence A029083 A005139 A005134
Adjacent sequences: A140433 A140434 A140435 this_sequence A140437 A140438 A140439
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Tanya Khovanova (tanyakh(AT)yahoo.com), Jun 20 2008
|
|
|
Search completed in 0.002 seconds
|
