A359893
Triangle read by rows where T(n,k) is the number of integer partitions of n with median k, where k ranges from 1 to n in steps of 1/2.
Original entry on oeis.org
1, 1, 0, 1, 1, 1, 0, 0, 1, 2, 0, 2, 0, 0, 0, 1, 3, 0, 1, 2, 0, 0, 0, 0, 1, 4, 1, 2, 0, 3, 0, 0, 0, 0, 0, 1, 6, 1, 3, 0, 1, 3, 0, 0, 0, 0, 0, 0, 1, 8, 1, 6, 0, 2, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1, 11, 2, 7, 1, 3, 0, 1, 4, 0, 0, 0, 0, 0, 0, 0, 0, 1
Offset: 1
Triangle begins:
1
1 0 1
1 1 0 0 1
2 0 2 0 0 0 1
3 0 1 2 0 0 0 0 1
4 1 2 0 3 0 0 0 0 0 1
6 1 3 0 1 3 0 0 0 0 0 0 1
8 1 6 0 2 0 4 0 0 0 0 0 0 0 1
11 2 7 1 3 0 1 4 0 0 0 0 0 0 0 0 1
15 2 10 3 4 0 2 0 5 0 0 0 0 0 0 0 0 0 1
20 3 13 3 7 0 3 0 1 5 0 0 0 0 0 0 0 0 0 0 1
26 4 19 3 11 1 4 0 2 0 6 0 0 0 0 0 0 0 0 0 0 0 1
For example, row n = 8 counts the following partitions:
611 4211 422 . 332 . 44 . . . . . . . 8
5111 521 431 53
32111 2222 62
41111 3221 71
221111 3311
311111 22211
2111111
11111111
Row lengths are 2n-1 =
A005408(n-1).
The median statistic is ranked by
A360005(n)/2.
A240219 counts partitions w/ the same mean as median, complement
A359894.
-
Table[Length[Select[IntegerPartitions[n], Median[#]==k&]],{n,1,10},{k,1,n,1/2}]
A359901
Triangle read by rows where T(n,k) is the number of integer partitions of n with median k = 1..n.
Original entry on oeis.org
1, 1, 1, 1, 0, 1, 2, 2, 0, 1, 3, 1, 0, 0, 1, 4, 2, 3, 0, 0, 1, 6, 3, 1, 0, 0, 0, 1, 8, 6, 2, 4, 0, 0, 0, 1, 11, 7, 3, 1, 0, 0, 0, 0, 1, 15, 10, 4, 2, 5, 0, 0, 0, 0, 1, 20, 13, 7, 3, 1, 0, 0, 0, 0, 0, 1, 26, 19, 11, 4, 2, 6, 0, 0, 0, 0, 0, 1
Offset: 1
Triangle begins:
1
1 1
1 0 1
2 2 0 1
3 1 0 0 1
4 2 3 0 0 1
6 3 1 0 0 0 1
8 6 2 4 0 0 0 1
11 7 3 1 0 0 0 0 1
15 10 4 2 5 0 0 0 0 1
20 13 7 3 1 0 0 0 0 0 1
26 19 11 4 2 6 0 0 0 0 0 1
35 24 14 5 3 1 0 0 0 0 0 0 1
45 34 17 8 4 2 7 0 0 0 0 0 0 1
58 42 23 12 5 3 1 0 0 0 0 0 0 0 1
For example, row n = 9 counts the following partitions:
(7,1,1) (5,2,2) (3,3,3) (4,4,1) . . . . (9)
(6,1,1,1) (6,2,1) (4,3,2)
(3,3,1,1,1) (3,2,2,2) (5,3,1)
(4,2,1,1,1) (4,2,2,1)
(5,1,1,1,1) (4,3,1,1)
(3,2,1,1,1,1) (2,2,2,2,1)
(4,1,1,1,1,1) (3,2,2,1,1)
(2,2,1,1,1,1,1)
(3,1,1,1,1,1,1)
(2,1,1,1,1,1,1,1)
(1,1,1,1,1,1,1,1,1)
Including half-steps gives
A359893.
The median statistic is ranked by
A360005(n)/2.
A240219 counts partitions w/ the same mean as median, complement
A359894.
-
Table[Length[Select[IntegerPartitions[n],Median[#]==k&]],{n,15},{k,n}]
A359902
Triangle read by rows where T(n,k) is the number of odd-length integer partitions of n with median k.
Original entry on oeis.org
1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 2, 2, 0, 0, 0, 1, 4, 2, 1, 0, 0, 0, 1, 4, 3, 2, 0, 0, 0, 0, 1, 7, 4, 3, 1, 0, 0, 0, 0, 1, 8, 6, 3, 2, 0, 0, 0, 0, 0, 1, 12, 8, 4, 3, 1, 0, 0, 0, 0, 0, 1, 14, 11, 5, 4, 2, 0, 0, 0, 0, 0, 0, 1
Offset: 1
Triangle begins:
1
0 1
1 0 1
1 0 0 1
2 1 0 0 1
2 2 0 0 0 1
4 2 1 0 0 0 1
4 3 2 0 0 0 0 1
7 4 3 1 0 0 0 0 1
8 6 3 2 0 0 0 0 0 1
12 8 4 3 1 0 0 0 0 0 1
14 11 5 4 2 0 0 0 0 0 0 1
21 14 8 4 3 1 0 0 0 0 0 0 1
24 20 10 5 4 2 0 0 0 0 0 0 0 1
34 25 15 6 5 3 1 0 0 0 0 0 0 0 1
For example, row n = 9 counts the following partitions:
(7,1,1) (5,2,2) (3,3,3) (4,4,1) . . . . (9)
(3,3,1,1,1) (6,2,1) (4,3,2)
(4,2,1,1,1) (2,2,2,2,1) (5,3,1)
(5,1,1,1,1) (3,2,2,1,1)
(2,2,1,1,1,1,1)
(3,1,1,1,1,1,1)
(1,1,1,1,1,1,1,1,1)
The median statistic is ranked by
A360005(n)/2.
A240219 counts partitions w/ the same mean as median, complement
A359894.
-
Table[Length[Select[IntegerPartitions[n],OddQ[Length[#]]&&Median[#]==k&]],{n,15},{k,n}]
A359889
Numbers that are 1 or whose prime indices have the same mean as median.
Original entry on oeis.org
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 43, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 64, 65, 67, 69, 71, 73, 74, 77, 79, 81, 82, 83, 85, 86, 87, 89, 90, 91, 93, 94
Offset: 1
The prime indices of 900 are {1,1,2,2,3,3}, with mean 2 and median 2, so 900 is in the sequence.
The RHS (median of prime indices) is
A360005/2.
A316413 lists numbers whose prime indices have integer mean.
A359908 lists numbers whose prime indices have integer median.
-
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],#==1||Mean[prix[#]]==Median[prix[#]]&]
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
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.
These partitions are counted by
A359894.
The RHS (median of prime indices) is
A360005/2.
A316413 lists numbers whose prime indices have integer mean.
A359908 lists numbers whose prime indices have integer median.
-
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000],Mean[prix[#]]!=Median[prix[#]]&]
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
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}
A360005 gives twice the median of prime indices.
Just two statistics:
- (median) = (mode): counted by
A363740.
-
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[#]]&]
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
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 complement is counted by
A359898.
A008289 counts strict partitions by mean.
A240850 counts strict partitions containing their mean, complement
A240851.
Cf.
A065795,
A066571,
A067659,
A082550,
A102627,
A135342,
A316313,
A327473,
A327475,
A328966,
A359909.
-
Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Mean[#]==Median[#]&]],{n,0,30}]
A363740
Number of integer partitions of n whose median appears more times than any other part, i.e., partitions containing a unique mode equal to the median.
Original entry on oeis.org
1, 2, 2, 4, 5, 7, 10, 15, 18, 26, 35, 46, 61, 82, 102, 136, 174, 224, 283, 360, 449, 569, 708, 883, 1089, 1352, 1659, 2042, 2492, 3039, 3695, 4492, 5426, 6555, 7889, 9482, 11360, 13602, 16231, 19348, 23005, 27313, 32364, 38303, 45227, 53341, 62800, 73829
Offset: 1
The a(1) = 1 through a(8) = 15 partitions:
(1) (2) (3) (4) (5) (6) (7) (8)
(11) (111) (22) (221) (33) (322) (44)
(211) (311) (222) (331) (332)
(1111) (2111) (411) (511) (422)
(11111) (3111) (2221) (611)
(21111) (4111) (2222)
(111111) (22111) (3221)
(31111) (5111)
(211111) (22211)
(1111111) (32111)
(41111)
(221111)
(311111)
(2111111)
(11111111)
A008284 counts partitions by length (or decreasing mean), strict
A008289.
-
modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],{Median[#]}==modes[#]&]],{n,30}]
A360244
Number of integer partitions of n where the parts do not have the same median as the distinct parts.
Original entry on oeis.org
0, 0, 0, 0, 1, 3, 3, 9, 11, 17, 23, 37, 42, 68, 87, 110, 153, 209, 261, 352, 444, 573, 750, 949, 1187, 1508, 1909, 2367, 2938, 3662, 4507, 5576, 6826, 8359, 10203, 12372, 15011, 18230, 21996, 26518, 31779, 38219, 45682, 54660, 65112, 77500, 92089, 109285
Offset: 0
The a(4) = 1 through a(9) = 17 partitions:
(211) (221) (411) (322) (332) (441)
(311) (3111) (331) (422) (522)
(2111) (21111) (511) (611) (711)
(2221) (4211) (3222)
(3211) (5111) (3321)
(4111) (22211) (4311)
(22111) (32111) (5211)
(31111) (41111) (6111)
(211111) (221111) (22221)
(311111) (33111)
(2111111) (42111)
(51111)
(321111)
(411111)
(2211111)
(3111111)
(21111111)
For example, the partition y = (33111) has median 1, and the distinct parts {1,3} have median 2, so y is counted under a(9).
These partitions are ranked by
A360248.
A008284 counts partitions by number of parts.
A116608 counts partitions by number of distinct parts.
A359894 counts partitions with mean different from median, ranks
A359890.
A360071 counts partitions by number of parts and number of distinct parts.
-
Table[Length[Select[IntegerPartitions[n], Median[#]!=Median[Union[#]]&]],{n,0,30}]
A363719
Number of integer partitions of n satisfying (mean) = (median) = (mode), assuming there is a unique mode.
Original entry on oeis.org
1, 2, 2, 3, 2, 4, 2, 5, 3, 5, 2, 10, 2, 7, 7, 12, 2, 18, 2, 24, 16, 13, 2, 58, 15, 18, 37, 60, 2, 123, 2, 98, 79, 35, 103, 332, 2, 49, 166, 451, 2, 515, 2, 473, 738, 92, 2, 1561, 277, 839, 631, 1234, 2, 2043, 1560, 2867, 1156, 225, 2, 9020
Offset: 1
The a(n) partitions for n = 1, 2, 4, 6, 8, 12, 14, 16 (A..G = 10..16):
1 2 4 6 8 C E G
11 22 33 44 66 77 88
1111 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
1^16
Just two statistics:
A008284 counts partitions by length (or negative mean), strict
A008289.
A362608 counts partitions with a unique mode.
-
modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n], {Mean[#]}=={Median[#]}==modes[#]&]],{n,30}]
Showing 1-10 of 38 results.
Comments