A359889 -id:A359889 - cp's OEIS frontend

A359895 Number of odd-length integer partitions of n whose parts have the same mean as median.

0, 1, 1, 2, 1, 2, 3, 2, 1, 5, 5, 2, 5, 2, 8, 18, 1, 2, 19, 2, 24, 41, 20, 2, 9, 44, 31, 94, 102, 2, 125, 2, 1, 206, 68, 365, 382, 2, 98, 433, 155, 2, 716, 2, 1162, 2332, 196, 2, 17, 1108, 563, 1665, 3287, 2, 3906, 5474, 2005, 3083, 509, 2, 9029

Offset: 0

Gus Wiseman, Jan 20 2023

nonn

The length and median of such a partition are integers with product n.

			The a(1) = 1 through a(9) = 5 partitions:
  (1)  (2)  (3)    (4)  (5)      (6)    (7)        (8)  (9)
            (111)       (11111)  (222)  (1111111)       (333)
                                 (321)                  (432)
                                                        (531)
                                                        (111111111)
The a(15) = 18 partitions:
  (15)
  (5,5,5)
  (6,5,4)
  (7,5,3)
  (8,5,2)
  (9,5,1)
  (3,3,3,3,3)
  (4,3,3,3,2)
  (4,4,3,2,2)
  (4,4,3,3,1)
  (5,3,3,2,2)
  (5,3,3,3,1)
  (5,4,3,2,1)
  (5,5,3,1,1)
  (6,3,3,2,1)
  (6,4,3,1,1)
  (7,3,3,1,1)
  (1,1,1,1,1,1,1,1,1,1,1,1,1,1,1)

Andrew Howroyd, Table of n, a(n) for n = 0..1000

This is the odd-length case of A240219, complement A359894, strict A359897.
These partitions are ranked by A359891, complement A359892.
The complement is counted by A359896.
The strict case is A359899, complement A359900.
The version for factorizations is A359910.
A000041 counts partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean, ranked by A326567/A326568.
A027193 counts odd-length partitions, strict A067659, ranked by A026424.
A067538 counts ptns with integer mean, strict A102627, ranked by A316413.
A237984 counts ptns containing their mean, strict A240850, ranked by A327473.
A325347 counts ptns with integer median, strict A359907, ranked by A359908.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A008289, A316313, A327472, A327475, A327482, A359889, A359906.

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

\\ P(n, k, m) is g.f. for k parts of max size m.
P(n, k, m)={polcoef(1/prod(i=1, m, 1 - y*x^i + O(x*x^n)), k, y)}
a(n)={if(n==0, 0, sumdiv(n, d, if(d%2, my(m=n/d, h=d\2, r=n-m*(h+1)+h); polcoef(P(r, h, m)*P(r, h, r), r))))} \\ Andrew Howroyd, Jan 21 2023

a(p) = 2 for prime p. - Andrew Howroyd, Jan 21 2023

A360245 Number of integer partitions of n where the parts have the same median as the distinct parts.

Original entry on oeis.org

1, 1, 2, 3, 4, 4, 8, 6, 11, 13, 19, 19, 35, 33, 48, 66, 78, 88, 124, 138, 183, 219, 252, 306, 388, 450, 527, 643, 780, 903, 1097, 1266, 1523, 1784, 2107, 2511, 2966, 3407, 4019, 4667, 5559, 6364, 7492, 8601, 10063, 11634, 13469, 15469, 17985, 20558, 23812

Offset: 0

Gus Wiseman, Feb 05 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(1) = 1 through a(8) = 11 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (11111)  (51)      (61)       (62)
                                     (222)     (421)      (71)
                                     (321)     (1111111)  (431)
                                     (2211)               (521)
                                     (111111)             (2222)
                                                          (3221)
                                                          (3311)
                                                          (11111111)
For example, the partition y = (6,4,4,4,1,1) has median 4, and the distinct parts {1,4,6} also have median 4, so y is counted under a(20).

For mean instead of median: A360242, ranks A360247, complement A360243.
These partitions have ranks A360249.
The complement is A360244, ranks A360248.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A116608 counts partitions by number of distinct parts.
A240219 counts partitions with mean equal to median, ranks A359889.
A325347 counts partitions w/ integer median, strict A359907, ranks A359908.
A359893 and A359901 count partitions by median.
A359894 counts partitions with mean different from median, ranks A359890.
A360071 counts partitions by number of parts and number of distinct parts.
Cf. A000975, A027193, A067659, A326619/A326620, A326621, A359902, A360241, A360246, A360250, A360251.

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

A363720 Number of integer partitions of n with different mean, median, and mode.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 2, 3, 5, 7, 16, 17, 34, 38, 50, 79, 115, 123, 198, 220, 291, 399, 536, 605, 815, 1036, 1241, 1520, 2059, 2315, 3132, 3708, 4491, 5668, 6587, 7788, 10259, 12299, 14515, 17153, 21558, 24623, 30876, 35540, 41476, 52023, 61931, 70811, 85545

Offset: 0

Gus Wiseman, Jun 21 2023

nonn

If there are multiple modes, then the mode is automatically considered different from the mean and median; otherwise, we take the unique mode.
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}.

			The a(7) = 2 through a(11) = 16 partitions:
  (421)   (431)   (621)    (532)     (542)
  (3211)  (521)   (3321)   (541)     (632)
          (4211)  (4311)   (631)     (641)
                  (5211)   (721)     (731)
                  (32211)  (5311)    (821)
                           (6211)    (4322)
                           (322111)  (4421)
                                     (5321)
                                     (5411)
                                     (6311)
                                     (7211)
                                     (33221)
                                     (43211)
                                     (52211)
                                     (332111)
                                     (422111)

For equal instead of unequal: A363719, ranks A363727, odd-length A363721.
The case of a unique mode is A363725.
These partitions have ranks A363730.
For factorizations we have A363742, for equal A363741, see A359909, A359910.
Just two statistics:
- (mean) = (median) gives A240219, also A359889, A359895, A359897, A359899.
- (mean) != (median) gives A359894, also A359890, A359896, A359898, A359900.
- (mean) = (mode) gives A363723, see A363724, A363731.
- (median) = (mode) gives A363740.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or negative mean), strict A008289.
A359893 and A359901 count partitions by median, odd-length A359902.
A362608 counts partitions with a unique mode.
Cf. A027193, A237984, A325347, A326567/A326568, A327472, A363726, A363728.

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

A359910 Number of odd-length integer factorizations of n into factors > 1 with the same mean as median.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3

Offset: 1

Gus Wiseman, Jan 24 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(n) factorizations for n = 120, 960, 5760, 6720:
  120      960         5760            6720
  4*5*6    2*16*30     16*18*20        4*30*56
  2*6*10   4*12*20     3*5*6*8*8       10*21*32
           8*10*12     4*4*6*6*10      12*20*28
           3*4*4*4*5   2*2*8*10*18     4*5*6*7*8
                       2*2*2*4*4*5*9   2*4*7*10*12
                                       2*2*2*4*5*6*7

Antti Karttunen, Table of n, a(n) for n = 1..65537

The version for partitions is A359895, ranked by A359891.
This is the odd-length case of A359909, partitions A240219.
A001055 counts factorizations.
A326622 counts factorizations with integer mean, strict A328966.
Cf. A316313, A326567/A326568, A359889, A359894, A359897, A359902, A359906, A359911, A360005.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],OddQ[Length[#]]&&Mean[#]==Median[#]&]],{n,100}]

A359910(n, m=n, facs=List([])) = if(1==n, (((#facs)%2) && (facs[(1+#facs)/2]==(vecsum(Vec(facs))/#facs))), my(s=0, newfacs); fordiv(n, d, if((d>1)&&(d<=m), newfacs = List(facs); listput(newfacs,d); s += A359910(n/d, d, newfacs))); (s)); \\ Antti Karttunen, Jan 20 2025

More terms from Antti Karttunen, Jan 20 2025

A359899 Number of strict odd-length integer partitions of n whose parts have the same mean as median.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 4, 1, 1, 6, 1, 1, 6, 1, 5, 7, 1, 1, 8, 12, 1, 9, 2, 1, 33, 1, 1, 11, 1, 50, 12, 1, 1, 13, 70, 1, 46, 1, 1, 122, 1, 1, 16, 102, 155, 17, 1, 1, 30, 216, 258, 19, 1, 1, 310, 1, 1, 666, 1, 382, 23, 1, 1, 23, 1596, 1, 393, 1, 1

Offset: 0

Gus Wiseman, Jan 20 2023

nonn

			The a(30) = 33 partitions:
  (30)  (11,10,9)  (8,7,6,5,4)
        (12,10,8)  (9,7,6,5,3)
        (13,10,7)  (9,8,6,4,3)
        (14,10,6)  (9,8,6,5,2)
        (15,10,5)  (10,7,6,4,3)
        (16,10,4)  (10,7,6,5,2)
        (17,10,3)  (10,8,6,4,2)
        (18,10,2)  (10,8,6,5,1)
        (19,10,1)  (10,9,6,3,2)
                   (10,9,6,4,1)
                   (11,7,6,4,2)
                   (11,7,6,5,1)
                   (11,8,6,3,2)
                   (11,8,6,4,1)
                   (11,9,6,3,1)
                   (12,7,6,3,2)
                   (12,7,6,4,1)
                   (12,8,6,3,1)
                   (12,9,6,2,1)
                   (13,7,6,3,1)
                   (13,8,6,2,1)
                   (14,7,6,2,1)
                   (11,10,6,2,1)

Andrew Howroyd, Table of n, a(n) for n = 0..1000

Strict odd-length case of A240219, complement A359894, ranked by A359889.
Strict case of A359895, complement A359896, ranked by A359891.
Odd-length case of A359897, complement A359898.
The complement is counted by A359900.
A000041 counts partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean, ranked by A326567/A326568.
A008289 counts strict partitions by mean.
A027193 counts odd-length partitions, strict A067659, ranked by A026424.
A067538 counts ptns with integer mean, strict A102627, ranked by A316413.
A237984 counts ptns containing their mean, strict A240850, ranked by A327473.
A325347 counts ptns with integer median, strict A359907, ranked by A359908.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000016, A065795, A066571, A240851, A359903, A359906, A359910.

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

\\ Q(n,k,m) is g.f. for k strict parts of max size m.
Q(n,k,m)={polcoef(prod(i=1, m, 1 + y*x^i + O(x*x^n)), k, y)}
a(n)={if(n==0, 0, sumdiv(n, d, if(d%2, my(m=n/d, h=d\2, r=n-m*(h+1)); if(r>=h*(h+1), polcoef(Q(r, h, m-1)*Q(r, h, r), r)))))} \\ Andrew Howroyd, Jan 21 2023

a(p) = 1 for prime p. - Andrew Howroyd, Jan 21 2023

A360007 Positions of first appearances in the sequence giving the median of the prime indices of n (A360005(n)/2).

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 11, 13, 14, 17, 19, 23, 26, 29, 31, 37, 38, 41, 43, 47, 53, 58, 59, 61, 67, 71, 73, 74, 79, 83, 86, 89, 97, 101, 103, 106, 107, 109, 113, 122, 127, 131, 137, 139, 142, 149, 151, 157, 158, 163, 167, 173, 178, 179, 181, 191, 193, 197, 199, 202

Offset: 1

Gus Wiseman, Jan 24 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).

Positions of first appearances in A360005.
The unsorted version is A360006.
For mean instead of median we have A360008.
A112798 lists prime indices, length A001222, sum A056239.
A316413 lists numbers whose prime indices have integer mean.
A325347 = partitions w/ integer median, strict A359907, complement A307683.
A326567/A326568 gives mean of prime indices.
A359893 counts partitions by median, cf. A359901, A359902.
A359908 = numbers w/ integer median of prime indices, complement A359912.
Cf. A026424, A359889, A359890, A360009.

nn=1000;
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
seq=Table[If[n==1,1,2*Median[prix[n]]],{n,nn}];
Select[Range[nn],FreeQ[seq[[Range[#-1]]],seq[[#]]]&]

Consists of 1, the primes, and all odd-indexed primes times 2.

A360453 Numbers for which the prime multiplicities (or sorted signature) have the same median as the distinct prime indices.

Original entry on oeis.org

1, 2, 9, 12, 18, 40, 100, 112, 125, 180, 250, 252, 300, 352, 360, 392, 396, 405, 450, 468, 504, 540, 588, 600, 612, 675, 684, 720, 756, 792, 828, 832, 882, 900, 936, 1008, 1044, 1116, 1125, 1176, 1188, 1200, 1224, 1332, 1350, 1368, 1372, 1404, 1440, 1452, 1476

Offset: 1

Gus Wiseman, Feb 10 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:
    1: {}
    2: {1}
    9: {2,2}
   12: {1,1,2}
   18: {1,2,2}
   40: {1,1,1,3}
  100: {1,1,3,3}
  112: {1,1,1,1,4}
  125: {3,3,3}
  180: {1,1,2,2,3}
  250: {1,3,3,3}
  252: {1,1,2,2,4}
  300: {1,1,2,3,3}
  352: {1,1,1,1,1,5}
  360: {1,1,1,2,2,3}
For example, the prime indices of 756 are {1,1,2,2,2,4} with distinct parts {1,2,4} with median 2 and multiplicities {1,2,3} with median 2, so 756 is in the sequence.

Without taking median we have A109298, unordered A109297.
For mean instead of median we have A324570, counted by A114638.
For indices instead of multiplicities we have A360249, counted by A360245.
For indices instead of distinct indices we have A360454, counted by A360456.
These partitions are counted by A360455.
A088529/A088530 gives mean of prime signature A124010.
A112798 lists prime indices, length A001222, sum A056239.
A240219 counts partitions with mean equal to median, ranks A359889.
A316413 = numbers whose prime indices have integer mean, distinct A326621.
A325347 = partitions with integer median, strict A359907, ranks A359908.
A326567/A326568 gives mean of prime indices.
A326619/A326620 gives mean of distinct prime indices.
A359893 and A359901 count partitions by median.
A360005 gives median of prime indices (times two).
Cf. A000975, A359890, A359903, A360068, A360244, A360247, A360248.

Select[Range[100],#==1||Median[Last/@FactorInteger[#]]== Median[PrimePi/@First/@FactorInteger[#]]&]

A363950 Numbers whose prime indices have rounded-up mean 2.

Original entry on oeis.org

3, 6, 9, 10, 12, 18, 20, 24, 27, 28, 30, 36, 40, 48, 54, 56, 60, 72, 80, 81, 84, 88, 90, 96, 100, 108, 112, 120, 144, 160, 162, 168, 176, 180, 192, 200, 208, 216, 224, 240, 243, 252, 264, 270, 280, 288, 300, 320, 324, 336, 352, 360, 384, 400, 416, 432, 448

Offset: 1

Gus Wiseman, Jul 05 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 terms together with their prime indices begin:
     3: {2}
     6: {1,2}
     9: {2,2}
    10: {1,3}
    12: {1,1,2}
    18: {1,2,2}
    20: {1,1,3}
    24: {1,1,1,2}
    27: {2,2,2}
    28: {1,1,4}
    30: {1,2,3}
    36: {1,1,2,2}
    40: {1,1,1,3}
    48: {1,1,1,1,2}
    54: {1,2,2,2}
    56: {1,1,1,4}
    60: {1,1,2,3}
    72: {1,1,1,2,2}
    80: {1,1,1,1,3}
    81: {2,2,2,2}

For mean 1 we have A000079 except 1.
Partitions of this type are counted by A026905 redoubled.
Equals the complement of A000079 in A344296.
Positions of 2's in A363944 (counted by column 2 of A363946).
For rounded mean 1 we have A363948, counted by A363947.
For rounded-down mean 1 we have A363949, counted by A025065.
The rounded-down or low version is A363954, counted by A363745.
A316413 ranks partitions with integer mean, counted by A067538.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A363941 gives low median of prime indices, triangle A124943.
A363942 gives high median of prime indices, triangle A124944.
Cf. A327473, A327476, A359889, A360005, A360013, A360015, A363727, A363943.

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

A363488 Even numbers whose prime factorization has at least as many 2's as non-2's.

Original entry on oeis.org

2, 4, 6, 8, 10, 12, 14, 16, 20, 22, 24, 26, 28, 32, 34, 36, 38, 40, 44, 46, 48, 52, 56, 58, 60, 62, 64, 68, 72, 74, 76, 80, 82, 84, 86, 88, 92, 94, 96, 100, 104, 106, 112, 116, 118, 120, 122, 124, 128, 132, 134, 136, 140, 142, 144, 146, 148, 152, 156, 158, 160

Offset: 1

Gus Wiseman, Jul 06 2023

nonn

The multiset of prime factors of n is row n of A027746.

Also numbers whose prime factors have low median 2, where the low median (see A124943) is either the middle part (for odd length), or the least of the two middle parts (for even length).

			The terms together with their prime indices begin:
     2: {1}            34: {1,7}             72: {1,1,1,2,2}
     4: {1,1}          36: {1,1,2,2}         74: {1,12}
     6: {1,2}          38: {1,8}             76: {1,1,8}
     8: {1,1,1}        40: {1,1,1,3}         80: {1,1,1,1,3}
    10: {1,3}          44: {1,1,5}           82: {1,13}
    12: {1,1,2}        46: {1,9}             84: {1,1,2,4}
    14: {1,4}          48: {1,1,1,1,2}       86: {1,14}
    16: {1,1,1,1}      52: {1,1,6}           88: {1,1,1,5}
    20: {1,1,3}        56: {1,1,1,4}         92: {1,1,9}
    22: {1,5}          58: {1,10}            94: {1,15}
    24: {1,1,1,2}      60: {1,1,2,3}         96: {1,1,1,1,1,2}
    26: {1,6}          62: {1,11}           100: {1,1,3,3}
    28: {1,1,4}        64: {1,1,1,1,1,1}    104: {1,1,1,6}
    32: {1,1,1,1,1}    68: {1,1,7}          106: {1,16}

Partitions of this type are counted by A027336.
The case without high median > 1 is A072978.
For mode instead of median we have A360015, high A360013.
Positions of 1's in A363941.
For mean instead of median we have A363949, high A000079.
The high version is A364056, positions of 1's in A363942.
A067538 counts partitions with integer mean, ranks A316413.
A112798 lists prime indices, length A001222, sum A056239.
A124943 counts partitions by low median, high A124944.
A363943 gives low mean of prime indices, triangle A363945.
Cf. A025065, A215366, A238495, A326567/A326568, A344296, A359889, A359908, A360005, A363486, A363487, A363944.

Select[Range[100],EvenQ[#]&&PrimeOmega[#]<=2*FactorInteger[#][[1,2]]&]

A363948 Numbers whose prime indices have mean < 3/2.

Original entry on oeis.org

2, 4, 8, 12, 16, 24, 32, 48, 64, 72, 80, 96, 128, 144, 160, 192, 256, 288, 320, 384, 432, 448, 480, 512, 576, 640, 768, 864, 896, 960, 1024, 1152, 1280, 1536, 1728, 1792, 1920, 2048, 2304, 2560, 2592, 2688, 2816, 2880, 3072, 3200, 3456, 3584, 3840, 4096, 4608

Offset: 1

Gus Wiseman, Jul 02 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 initial terms, prime indices, and means:
    2: {1} -> 1
    4: {1,1} -> 1
    8: {1,1,1} -> 1
   12: {1,1,2} -> 4/3
   16: {1,1,1,1} -> 1
   24: {1,1,1,2} -> 5/4
   32: {1,1,1,1,1} -> 1
   48: {1,1,1,1,2} -> 6/5
   64: {1,1,1,1,1,1} -> 1
   72: {1,1,1,2,2} -> 7/5
   80: {1,1,1,1,3} -> 7/5
   96: {1,1,1,1,1,2} -> 7/6

These partitions are counted by A363947.
Prime indices have mean A326567/A326568.
For low mode we have A360015, high A360013.
Positions of 1's in A363489.
A112798 lists prime indices, length A001222, sum A056239.
A316413 ranks partitions with integer mean, counted by A067538.
A360005 gives twice the median of prime indices.
A363949 ranks partitions with low mean 1, counted by A025065.
A363950 ranks partitions with low mean 2, counted by A026905 redoubled.
Cf. A051293, A124944, A327473, A327476, A327482, A359889, A363727, A363942, A363943, A363946, A363951.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Mean[prix[#]]<3/2&]

cp's OEIS Frontend

A359895 Number of odd-length integer partitions of n whose parts have the same mean as median.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A360245 Number of integer partitions of n where the parts have the same median as the distinct parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A363720 Number of integer partitions of n with different mean, median, and mode.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A359910 Number of odd-length integer factorizations of n into factors > 1 with the same mean as median.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A359899 Number of strict odd-length integer partitions of n whose parts have the same mean as median.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A360007 Positions of first appearances in the sequence giving the median of the prime indices of n (A360005(n)/2).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

A360453 Numbers for which the prime multiplicities (or sorted signature) have the same median as the distinct prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A363950 Numbers whose prime indices have rounded-up mean 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs