login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A363725
Number of integer partitions of n with a different mean, median, and mode, assuming there is a unique mode.
15
0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 3, 8, 8, 17, 19, 28, 39, 59, 68, 106, 123, 165, 220, 301, 361, 477, 605, 745, 929, 1245, 1456, 1932, 2328, 2846, 3590, 4292, 5111, 6665, 8040, 9607, 11532, 14410, 16699, 20894, 24287, 28706, 35745, 42845, 49548, 59963, 70985
OFFSET
0,10
COMMENTS
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).
A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes of {a,a,b,b,b,c,d,d,d} are {b,d}.
EXAMPLE
The a(7) = 1 through a(13) = 17 partitions:
(3211) (4211) (3321) (5311) (4322) (4431) (4432)
(4311) (6211) (4421) (5322) (5422)
(5211) (322111) (5411) (6411) (5521)
(6311) (7311) (6322)
(7211) (8211) (6511)
(43211) (53211) (7411)
(332111) (432111) (8311)
(422111) (522111) (9211)
(54211)
(63211)
(333211)
(433111)
(442111)
(532111)
(622111)
(3322111)
(32221111)
MATHEMATICA
modes[ms_]:=Select[Union[ms], Count[ms, #]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n], Length[modes[#]]==1&&Mean[#]!=Median[#]!=First[modes[#]]&]], {n, 0, 30}]
CROSSREFS
The length-4 case appears to be A325695.
For equal instead of unequal we have A363719, ranks A363727.
Allowing multiple modes gives A363720, ranks A363730.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A359893 and A359901 count partitions by median, odd-length A359902.
A362608 counts partitions with a unique mode.
Sequence in context: A135291 A058617 A205977 * A238623 A138135 A113166
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jun 22 2023
STATUS
approved