A240219 -id:A240219 - cp's OEIS frontend

A363723 Number of integer partitions of n having a unique mode equal to the mean, i.e., partitions whose mean appears more times than each of the other parts.

0, 1, 2, 2, 3, 2, 4, 2, 5, 3, 5, 2, 10, 2, 7, 7, 12, 2, 18, 2, 24, 16, 13, 2, 60, 15, 18, 37, 60, 2, 129, 2, 104, 80, 35, 104, 352, 2, 49, 168, 501, 2, 556, 2, 489, 763, 92, 2, 1799, 292, 985, 649, 1296, 2, 2233, 1681, 3379, 1204, 225, 2, 10661

Offset: 0

Gus Wiseman, Jun 24 2023

nonn

A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes in {a,a,b,b,b,c,d,d,d} are {b,d}.

			The a(n) partitions for n = 6, 8, 12, 14, 16 (A..G = 10..16):
  (6)       (8)         (C)             (E)               (G)
  (33)      (44)        (66)            (77)              (88)
  (222)     (2222)      (444)           (2222222)         (4444)
  (111111)  (3221)      (3333)          (3222221)         (5443)
            (11111111)  (4332)          (3322211)         (6442)
                        (5331)          (4222211)         (7441)
                        (222222)        (11111111111111)  (22222222)
                        (322221)                          (32222221)
                        (422211)                          (33222211)
                        (111111111111)                    (42222211)
                                                          (52222111)
                                                          (1111111111111111)

Partitions containing their mean are counted by A237984, ranks A327473.
For median instead of mode we have A240219, ranks A359889.
Partitions missing their mean are counted by A327472, ranks A327476.
The case of non-constant partitions is A362562.
Including median also gives A363719, ranks A363727.
Allowing multiple modes gives A363724.
Requiring multiple modes gives A363731.
For median instead of mean we have A363740.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A359893 and A359901 count partitions by median.
A362608 counts partitions with a unique mode.
Cf. A325347, A326567/A326568, A363720, A363725, A363730.

modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],{Mean[#]}==modes[#]&]],{n,30}]

A359890 Numbers whose prime indices do not have the same mean as median.

Original entry on oeis.org

12, 18, 20, 24, 28, 40, 42, 44, 45, 48, 50, 52, 54, 56, 60, 63, 66, 68, 70, 72, 75, 76, 78, 80, 84, 88, 92, 96, 98, 99, 102, 104, 108, 112, 114, 116, 117, 120, 124, 126, 130, 132, 135, 136, 138, 140, 144, 147, 148, 150, 152, 153, 154, 156, 160, 162, 164, 165

Offset: 1

Gus Wiseman, Jan 22 2023

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

			The terms together with their prime indices begin:
   12: {1,1,2}
   18: {1,2,2}
   20: {1,1,3}
   24: {1,1,1,2}
   28: {1,1,4}
   40: {1,1,1,3}
   42: {1,2,4}
   44: {1,1,5}
   45: {2,2,3}
   48: {1,1,1,1,2}
For example, the prime indices of 360 are {1,1,1,2,2,3}, with mean 5/3 and median 3/2, so 360 is in the sequence.

The LHS (mean of prime indices) is A326567/A326568.
The complement is A359889, counted by A240219.
The odd-length case is A359891, complement A359892.
These partitions are counted by A359894.
The strict case is counted by A359898, odd-length A359900.
The RHS (median of prime indices) is A360005/2.
A058398 counts partitions by mean, see also A008284, A327482.
A088529/A088530 gives mean of prime signature A124010.
A112798 lists prime indices, length A001222, sum A056239.
A316413 lists numbers whose prime indices have integer mean.
A359908 lists numbers whose prime indices have integer median.
Cf. A327473, A327476, A348551, A359903, A359911, A359912, A360006-A360009.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000],Mean[prix[#]]!=Median[prix[#]]&]

A124943 Table read by rows: number of partitions of n with k as low median.

Original entry on oeis.org

1, 1, 1, 2, 0, 1, 3, 1, 0, 1, 4, 2, 0, 0, 1, 6, 3, 1, 0, 0, 1, 8, 4, 2, 0, 0, 0, 1, 11, 6, 3, 1, 0, 0, 0, 1, 15, 8, 4, 2, 0, 0, 0, 0, 1, 20, 12, 5, 3, 1, 0, 0, 0, 0, 1, 26, 16, 7, 4, 2, 0, 0, 0, 0, 0, 1, 35, 22, 10, 5, 3, 1, 0, 0, 0, 0, 0, 1, 45, 29, 14, 6, 4, 2, 0, 0, 0, 0, 0, 0, 1, 58, 40, 19, 8, 5, 3, 1

Offset: 1

Franklin T. Adams-Watters, Nov 13 2006

For a multiset with an odd number of elements, the low median is the same as the median. For a multiset with an even number of elements, the low median is the smaller of the two central elements.

Arrange the parts of a partition nonincreasing order. Remove the first part, then the last, then the first remaining part, then the last remaining part, and continue until only a single number, the low median, remains. - Clark Kimberling, May 16 2019

			For the partition [2,1^2], the sole middle element is 1, so that is the low median. For [3,2,1^2], the two middle elements are 1 and 2; the low median is the smaller, 1.
First 8 rows:
  1
  1   1
  2   0   1
  3   1   0   1
  4   2   0   0   1
  6   3   1   0   0   1
  8   4   2   0   0   0   1
  11  6   3   1   0   0   0   1
From _Gus Wiseman_, Jul 09 2023: (Start)
Row n = 8 counts the following partitions:
  (71)        (62)     (53)   (44)  .  .  .  (8)
  (611)       (521)    (431)
  (5111)      (422)    (332)
  (4211)      (3221)
  (41111)     (2222)
  (3311)      (22211)
  (32111)
  (311111)
  (221111)
  (2111111)
  (11111111)
(End)

Row sums are A000041.
Column k = 1 is A027336, ranks A363488.
The high version of this triangle is A124944.
The rank statistic for this triangle is A363941, high version A363942.
A version for mean instead of median is A363945, rank statistic A363943.
A high version for mean instead of median is A363946, rank stat A363944.
A version for mode instead of median is A363952, high A363953.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A325347 counts partitions with integer median, ranks A359908.
A359893 and A359901 count partitions by median.
A360005(n)/2 returns median of prime indices.
Cf. A025065, A026794, A027193, A067538, A237984, A240219, A362608, A363740.

Map[BinCounts[#, {1, #[[1]] + 1, 1}] &[Map[#[[Floor[(Length[#] + 2)/2]]] &, IntegerPartitions[#]]] &, Range[13]]  (* Peter J. C. Moses, May 14 2019 *)

A363727 Numbers whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 89, 90, 97, 101, 103, 107, 109, 113, 121, 125, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199

Offset: 1

Gus Wiseman, Jun 23 2023

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes in {a,a,b,b,b,c,d,d,d} are {b,d}.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

			The terms together with their prime indices begin:
     2: {1}          29: {10}              79: {22}
     3: {2}          31: {11}              81: {2,2,2,2}
     4: {1,1}        32: {1,1,1,1,1}       83: {23}
     5: {3}          37: {12}              89: {24}
     7: {4}          41: {13}              90: {1,2,2,3}
     8: {1,1,1}      43: {14}              97: {25}
     9: {2,2}        47: {15}             101: {26}
    11: {5}          49: {4,4}            103: {27}
    13: {6}          53: {16}             107: {28}
    16: {1,1,1,1}    59: {17}             109: {29}
    17: {7}          61: {18}             113: {30}
    19: {8}          64: {1,1,1,1,1,1}    121: {5,5}
    23: {9}          67: {19}             125: {3,3,3}
    25: {3,3}        71: {20}             127: {31}
    27: {2,2,2}      73: {21}             128: {1,1,1,1,1,1,1}

These partitions are counted by A363719, factorizations A363741.
For unequal instead of equal we have A363730, counted by A363720.
Excluding primes gives A363722.
Excluding prime-powers gives A363729, counted by A363728.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A356862 ranks partitions with a unique mode, counted by A362608.
A359178 ranks partitions with multiple modes, counted by A362610.
A360005 gives twice the median of prime indices.
A362611 counts modes in prime indices, triangle A362614.
A362613 counts co-modes in prime indices, triangle A362615.
A363486 gives least mode in prime indices, A363487 greatest.
Just two statistics:
- (mean) = (median): A359889, counted by A240219.
- (mean) != (median): A359890, counted by A359894.
- (mean) = (mode): counted by A363723, see A363724, A363731.
- (median) = (mode): counted by A363740.
Cf. A215366, A327473, A327476, A359893, A359908, A360009, A360248, A360550, A363721, A363725.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Select[Range[100],{Mean[prix[#]]}=={Median[prix[#]]}==modes[prix[#]]&]

Assuming there is a unique mode, we have A326567(a(n))/A326568(a(n)) = A360005(a(n))/2 = A363486(a(n)) = A363487(a(n)).

A238479 Number of partitions of n whose median is not a part.

Original entry on oeis.org

0, 0, 1, 1, 2, 3, 4, 5, 8, 10, 13, 18, 23, 30, 40, 50, 64, 83, 104, 131, 166, 206, 256, 320, 394, 485, 598, 730, 891, 1088, 1318, 1596, 1932, 2326, 2797, 3360, 4020, 4804, 5735, 6824, 8108, 9624, 11392, 13468, 15904, 18737, 22048, 25914, 30400, 35619, 41686

Offset: 1

Clark Kimberling, Feb 27 2014

Also, the number of partitions p of n such that (1/2)*max(p) is a part of p.

Also the number of even-length integer partitions of n with distinct middle parts. For example, the partition (4,3,2,1) has middle parts {2,3} so is counted under a(10), but (3,2,2,1) has middle parts {2,2} so is not counted under a(8). - Gus Wiseman, May 13 2023

			a(6) counts these partitions:  51, 42, 2211 which all have an even number of parts, and their medians 3, 3 and 1.5 are not present. Note that the partitions 33 and 3111, although having an even number of parts, are not included in the count of a(6), but instead in that of A238478(6), as their medians, 3 for the former and 1 for the latter, are present in those partitions.

A. Blecher and A. Knopfmacher, Fixed points and matching points in partitions, Ramanujan J. 58 (2022), 23-41.

The complement is A238478, ranks A362618.
For mean instead of median we have A327472, complement A237984.
These partitions have ranks A362617.
A000041 counts integer partitions, even-length A027187.
A325347 counts partitions with integer median, complement A307683.
A359893/A359901/A359902 count partitions by median.
A359908 ranks partitions with integer median, complement A359912.
Cf. A002865, A008284, A053263, A238480, A238481, A240219, A359907, A360686, A360687, A360952.

Table[Count[IntegerPartitions[n], p_ /; !MemberQ[p, Median[p]]], {n, 40}]
(* also *)
Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Max[p]/2]], {n, 50}]

my(q='q+O('q^50)); concat([0,0], Vec(sum(n=1,17,q^(3*n)/prod(k=1,2*n,1-q^k)))) \\ David Radcliffe, Jun 25 2025

from sympy.utilities.iterables import partitions
def A238479(n): return sum(1 for p in partitions(n) if (m:=max(p,default=0))&1^1 and m>>1 in p) # Chai Wah Wu, Sep 21 2023

a(n) = A000041(n) - A238478(n).
For all n, A027187(n) >= a(n). [Because when a partition of n has an odd number of parts, then it is not counted by this sequence (cf. A238478) and also some of the partitions with an even number of parts might be excluded here. Cf. Examples.] - Antti Karttunen, Feb 27 2014
From Jeremy Lovejoy, Sep 29 2022: (Start)
G.f.: Sum_{n>=1} q^(3*n)/Product_{k=1..2*n} (1-q^k).
a(n) ~ Pi/(2^(17/4)*3^(3/4)*n^(5/4))*exp(Pi*sqrt(2*n/3)). Proved by Blecher and Knopfmacher. (End)
a(n) = A087897(2*n) = A035294(n) - A078408(n-1). - Mathew Englander, May 20 2023

A361849 Number of integer partitions of n such that the maximum is twice the median.

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 4, 3, 4, 7, 9, 9, 15, 16, 20, 26, 34, 37, 50, 55, 68, 86, 103, 117, 145, 168, 201, 236, 282, 324, 391, 449, 525, 612, 712, 818, 962, 1106, 1278, 1470, 1698, 1939, 2238, 2550, 2924, 3343, 3824, 4341, 4963, 5627, 6399, 7256, 8231, 9300

Offset: 1

Gus Wiseman, Apr 02 2023

nonn

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

			The a(4) = 1 through a(11) = 9 partitions:
  211  2111  21111  421     422      4221      631        632
                    3211    221111   4311      4222       5321
                    22111   2111111  2211111   42211      5411
                    211111           21111111  322111     42221
                                               2221111    43211
                                               22111111   332111
                                               211111111  22211111
                                                          221111111
                                                          2111111111
For example, the partition (3,2,1,1) has maximum 3 and median 3/2, so is counted under a(7).

For minimum instead of median we have A118096.
For length instead of median we have A237753.
This is the equal case of A361848.
For mean instead of median we have A361853.
These partitions have ranks A361856.
For "greater" instead of "equal" we have A361857, allowing equality A361859.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, A058398 by mean.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median, odd-length A359902.
A360005 gives twice median of prime indices, distinct A360457.
A361860 counts partitions with minimum equal to median.
Cf. A013580, A027193, A053263, A061395, A067659, A111907, A116608, A237755, A240219, A361851.

Table[Length[Select[IntegerPartitions[n],Max@@#==2*Median[#]&]],{n,30}]

A124944 Table, number of partitions of n with k as high median.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 4, 3, 1, 1, 1, 1, 6, 4, 1, 1, 1, 1, 1, 8, 6, 3, 1, 1, 1, 1, 1, 11, 8, 5, 1, 1, 1, 1, 1, 1, 15, 11, 7, 3, 1, 1, 1, 1, 1, 1, 20, 15, 9, 5, 1, 1, 1, 1, 1, 1, 1, 26, 21, 12, 8, 3, 1, 1, 1, 1, 1, 1, 1, 35, 27, 16, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 45, 37, 21, 13, 8, 3

Offset: 1

Franklin T. Adams-Watters, Nov 13 2006

For a multiset with an odd number of elements, the high median is the same as the median. For a multiset with an even number of elements, the high median is the larger of the two central elements.
This table may be read as an upper right triangle with n >= 1 as column index and k >= 1 as row index. - Peter Munn, Jul 16 2017
Arrange the parts of a partition nonincreasing order.  Remove the last part, then the first, then the last remaining part, then the first remaining part, and continue until only a single number, the high median, remains. - Clark Kimberling, May 14 2019

			For the partition [2,1^2], the sole middle element is 1, so that is the high median. For [3,2,1^2], the two middle elements are 1 and 2; the high median is the larger, 2.
From _Gus Wiseman_, Jul 12 2023: (Start)
Triangle begins:
   1
   1  1
   1  1  1
   2  1  1  1
   3  1  1  1  1
   4  3  1  1  1  1
   6  4  1  1  1  1  1
   8  6  3  1  1  1  1  1
  11  8  5  1  1  1  1  1  1
  15 11  7  3  1  1  1  1  1  1
  20 15  9  5  1  1  1  1  1  1  1
  26 21 12  8  3  1  1  1  1  1  1  1
  35 27 16 10  5  1  1  1  1  1  1  1  1
  45 37 21 13  8  3  1  1  1  1  1  1  1  1
  58 48 29 16 11  5  1  1  1  1  1  1  1  1  1
Row n = 8 counts the following partitions:
  (611)       (521)    (431)   (44)  (53)  (62)  (71)  (8)
  (5111)      (422)    (332)
  (41111)     (4211)   (3311)
  (32111)     (3221)
  (311111)    (2222)
  (221111)    (22211)
  (2111111)
  (11111111)
(End)

Row sums are A000041.
Column k = 1 is A027336(n-1), ranks A364056.
Column k = 1 in the low version is A027336, ranks A363488.
The low version of this triangle is A124943.
The rank statistic for this triangle is A363942, low version A363941.
A version for mean instead of median is A363946, low A363945.
A version for mode instead of median is A363953, low A363952.
A008284 counts partitions by length, maximum, or decreasing mean.
A026794 counts partitions by minimum, strict A026821.
A325347 counts partitions with integer median, ranks A359908.
A359893 and A359901 count partitions by median.
A360005(n)/2 returns median of prime indices.
Cf. A008289, A025065, A027193, A067538, A237984, A240219, A362608, A363740, A363943, A363944.

Map[BinCounts[#, {1, #[[1]] + 1, 1}] &[Map[#[[Floor[(Length[#] + 1)/2]]] &, IntegerPartitions[#]]] &, Range[13]]  (* Peter J. C. Moses, May 14 2019 *)

A363724 Number of integer partitions of n whose mean is a mode, i.e., partitions whose mean appears at least as many times as each of the other parts.

Original entry on oeis.org

1, 2, 2, 3, 2, 5, 2, 5, 5, 6, 2, 15, 2, 8, 15, 17, 2, 30, 2, 43, 30, 15, 2, 112, 36, 21, 60, 119, 2, 251, 2, 201, 126, 41, 271, 655, 2, 57, 250, 1060, 2, 1099, 2, 844, 1508, 107, 2, 3484, 802, 2068, 900, 2136, 2, 4558, 3513, 7071, 1630, 259, 2, 20260

Offset: 1

Gus Wiseman, Jun 24 2023

nonn

A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes in {a,a,b,b,b,c,d,d,d} are {b,d}.

			The a(n) partitions for n = 6, 10, 12:
  (6)            (10)                   (12)
  (3,3)          (5,5)                  (6,6)
  (2,2,2)        (2,2,2,2,2)            (4,4,4)
  (3,2,1)        (3,2,2,2,1)            (5,4,3)
  (1,1,1,1,1,1)  (4,2,2,1,1)            (6,4,2)
                 (1,1,1,1,1,1,1,1,1,1)  (7,4,1)
                                        (3,3,3,3)
                                        (4,3,3,2)
                                        (5,3,3,1)
                                        (6,3,2,1)
                                        (2,2,2,2,2,2)
                                        (3,2,2,2,2,1)
                                        (3,3,2,2,1,1)
                                        (4,2,2,2,1,1)
                                        (1,1,1,1,1,1,1,1,1,1,1,1)

For parts instead of modes we have A237984, complement A327472.
The case of a unique mode is A363723, non-constant A362562.
The case of more than one mode is A363731.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or decreasing mean), strict A008289.
A362608 counts partitions with a unique mode.
A363719 = all three averages equal, ranks A363727, non-constant A363728.
A363720 = all three averages different, ranks A363730, unique mode A363725.
Cf. A240219, A326567/A326568, A363726, A363740.

modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],MemberQ[modes[#],Mean[#]]&]],{n,30}]

A359897 Number of strict integer partitions of n whose parts have the same mean as median.

Original entry on oeis.org

0, 1, 1, 2, 2, 3, 4, 4, 4, 7, 6, 6, 10, 7, 10, 13, 11, 9, 20, 10, 20, 18, 21, 12, 30, 24, 28, 27, 30, 15, 73, 16, 37, 43, 45, 67, 74, 19, 55, 71, 126, 21, 150, 22, 75, 225, 78, 24, 183, 126, 245, 192, 132, 27, 284, 244, 403, 303, 120, 30, 828

Offset: 0

Gus Wiseman, Jan 20 2023

nonn

			The a(1) = 1 through a(9) = 7 partitions:
  (1)  (2)  (3)    (4)    (5)    (6)      (7)    (8)    (9)
            (2,1)  (3,1)  (3,2)  (4,2)    (4,3)  (5,3)  (5,4)
                          (4,1)  (5,1)    (5,2)  (6,2)  (6,3)
                                 (3,2,1)  (6,1)  (7,1)  (7,2)
                                                        (8,1)
                                                        (4,3,2)
                                                        (5,3,1)

The non-strict version is A240219, complement A359894, ranked by A359889.
The complement is counted by A359898.
The odd-length case is A359899, complement A359900.
A000041 counts partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean, ranked by A326567/A326568.
A008289 counts strict partitions by mean.
A237984 counts partitions containing their mean, complement A327472.
A240850 counts strict partitions containing their mean, complement A240851.
A325347 counts ptns with integer median, strict A359907, ranked by A359908.
Cf. A065795, A066571, A067659, A082550, A102627, A135342, A316313, A327473, A327475, A328966, A359909.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Mean[#]==Median[#]&]],{n,0,30}]

A237363 Number of partitions of n for which 2*(number of distinct parts) <= (number of parts).

Original entry on oeis.org

1, 0, 1, 1, 2, 2, 6, 6, 10, 13, 20, 26, 39, 50, 71, 87, 121, 156, 208, 265, 348, 440, 566, 712, 906, 1131, 1424, 1766, 2224, 2738, 3390, 4168, 5130, 6266, 7664, 9312, 11332, 13723, 16603, 20004, 24112, 28942, 34708, 41522, 49612, 59031, 70308, 83479, 98992

Offset: 0

Clark Kimberling, Feb 06 2014

nonn

a(n) + A237365(n) = A000041(n).

Also the number of integer partitions of n whose median difference is 0. For example, the partition (2,2,2,1,1) is counted because its multiset of differences {0,0,0,1} has median 0. - Gus Wiseman, Mar 18 2023

			Among the 22 partitions of 8, these qualify:  [5,1,1,1], [4,4], [4,1,1,1,1], [3,3,1,1], [3,1,1,1,1,1], [2,2,2,2], [2,2,2,1,1], [2,2,1,1,1,1], [2,1,1,1,1,1,1], [1,1,1,1,1,1,1,1], and the remaining 12 do not, so that a(8) = 10.

Alois P. Heinz, Table of n, a(n) for n = 0..800

These partitions have ranks A361204.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts, reverse A058398.
A116608 counts partitions by number of distinct parts.
A359893 and A359901 count partitions by median, odd-length A359902.
Comparing twice the number of distinct parts to the number of parts:
              less: A360254, ranks A360558
             equal: A239959, ranks A067801
           greater: A237365, ranks A361393
     less or equal: A237363, ranks A361204
  greater or equal: A361394, ranks A361395
Cf. A000975, A027193, A114638, A240219, A325347, A360005, A360244.

z = 50; t = Map[Length[Select[IntegerPartitions[#], 2*Length[DeleteDuplicates[#]] <= Length[#] &]] &, Range[z]] (*A237363*)
Table[PartitionsP[n] - t[[n]], {n, 1, z}] (*A237365*) (* Peter J. C. Moses, Feb 06 2014 *)
Table[Length[Select[IntegerPartitions[n],Median[Differences[#]]==0&]],{n,0,30}] (* Gus Wiseman, Mar 18 2023 *)

cp's OEIS Frontend

A363723 Number of integer partitions of n having a unique mode equal to the mean, i.e., partitions whose mean appears more times than each of the other parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A359890 Numbers whose prime indices do not have the same mean as median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A124943 Table read by rows: number of partitions of n with k as low median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A363727 Numbers whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A238479 Number of partitions of n whose median is not a part.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A361849 Number of integer partitions of n such that the maximum is twice the median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A124944 Table, number of partitions of n with k as high median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A363724 Number of integer partitions of n whose mean is a mode, i.e., partitions whose mean appears at least as many times as each of the other parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A359897 Number of strict integer partitions of n whose parts have the same mean as median.

Views