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}]
A307683
Number of partitions of n having a non-integer median.
Original entry on oeis.org
0, 0, 1, 0, 2, 1, 4, 1, 7, 5, 11, 8, 18, 17, 31, 28, 47, 51, 75, 81, 119, 134, 181, 206, 277, 323, 420, 488, 623, 737, 922, 1084, 1352, 1597, 1960, 2313, 2819, 3330, 4029, 4743, 5704, 6722, 8030, 9434, 11234, 13175, 15601, 18262, 21552, 25184, 29612, 34518
Offset: 1
a(7) counts these 4 partitions: [6,1], [5,2], [4,3], [3,2,1,1].
Cf.
A000016,
A051293,
A067538,
A082550,
A240219,
A240850,
A316413,
A326567/
A326568,
A327475,
A359897,
A360005.
A359907
Number of strict integer partitions of n with integer median.
Original entry on oeis.org
0, 1, 1, 1, 2, 1, 4, 2, 6, 4, 9, 6, 14, 10, 18, 16, 27, 23, 36, 34, 51, 49, 67, 68, 94, 95, 122, 129, 166, 174, 217, 233, 287, 308, 371, 405, 487, 528, 622, 683, 805, 880, 1024, 1127, 1305, 1435, 1648, 1818, 2086, 2295, 2611, 2882, 3273, 3606, 4076, 4496, 5069
Offset: 0
The a(1) = 1 through a(14) = 18 partitions (A..E = 10..14):
1 2 3 4 5 6 7 8 9 A B C D E
31 42 421 53 432 64 542 75 643 86
51 62 531 73 632 84 652 95
321 71 621 82 641 93 742 A4
431 91 731 A2 751 B3
521 532 821 B1 832 C2
541 543 841 D1
631 642 931 653
721 651 A21 743
732 6421 752
741 761
831 842
921 851
5421 932
941
A31
B21
7421
The median statistic is ranked by
A360005(n)/2.
-
Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&IntegerQ[Median[#]]&]],{n,0,30}]
A362614
Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k modes.
Original entry on oeis.org
1, 0, 1, 0, 2, 0, 2, 1, 0, 4, 1, 0, 5, 2, 0, 7, 3, 1, 0, 11, 3, 1, 0, 16, 4, 2, 0, 21, 6, 3, 0, 29, 8, 4, 1, 0, 43, 7, 5, 1, 0, 54, 13, 8, 2, 0, 78, 12, 8, 3, 0, 102, 17, 11, 5, 0, 131, 26, 12, 6, 1, 0, 175, 29, 17, 9, 1, 0, 233, 33, 18, 11, 2, 0, 295, 47, 25
Offset: 0
Triangle begins:
1
0 1
0 2
0 2 1
0 4 1
0 5 2
0 7 3 1
0 11 3 1
0 16 4 2
0 21 6 3
0 29 8 4 1
0 43 7 5 1
0 54 13 8 2
0 78 12 8 3
0 102 17 11 5
0 131 26 12 6 1
0 175 29 17 9 1
Row n = 8 counts the following partitions:
(8) (53) (431)
(44) (62) (521)
(332) (71)
(422) (3311)
(611)
(2222)
(3221)
(4211)
(5111)
(22211)
(32111)
(41111)
(221111)
(311111)
(2111111)
(11111111)
Removing columns 0 and 1 and taking sums gives
A362607, ranks
A362605.
This statistic (mode-count) is ranked by
A362611.
A008284 counts partitions by length.
A275870 counts collapsible partitions.
-
msi[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],Length[msi[#]]==k&]],{n,0,15},{k,0,Floor[(Sqrt[1+8n]-1)/2]}]
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[#]]&]
A362610
Number of integer partitions of n having a unique part of least multiplicity.
Original entry on oeis.org
0, 1, 2, 2, 4, 5, 7, 10, 13, 16, 23, 30, 35, 50, 61, 73, 95, 123, 139, 187, 216, 269, 328, 411, 461, 594, 688, 836, 980, 1211, 1357, 1703, 1936, 2330, 2697, 3253, 3649, 4468, 5057, 6005, 6841, 8182, 9149, 10976, 12341, 14508, 16447, 19380, 21611, 25553, 28628
Offset: 0
The partition (3,3,2,2,2,1,1,1) has least multiplicity 2, and only one part of multiplicity 2 (namely 3), so is counted under a(15).
The a(1) = 1 through a(8) = 13 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) (5111)
(31111) (22211)
(211111) (41111)
(1111111) (221111)
(311111)
(2111111)
(11111111)
These partitions have ranks
A359178.
A275870 counts collapsible partitions.
A359893 counts partitions by median.
Cf.
A008284,
A053263,
A098859,
A237984,
A240219,
A304442,
A327472,
A353863,
A353864,
A353865,
A362612.
-
Table[Length[Select[IntegerPartitions[n],Count[Length/@Split[#],Min@@Length/@Split[#]]==1&]],{n,0,30}]
-
seq(n) = my(A=O(x*x^n)); Vec(sum(m=2, n+1, sum(j=1, n, x^(j*(m-1))/(1 + if(j*m<=n, x^(j*m)/(1-x^j) )) + A)*prod(j=1, n\m, 1 + x^(j*m)/(1 - x^j) + A)), -(n+1)) \\ Andrew Howroyd, May 04 2023
A359894
Number of integer partitions of n whose parts do not have the same mean as median.
Original entry on oeis.org
0, 0, 0, 0, 1, 3, 3, 10, 13, 20, 28, 49, 53, 93, 113, 145, 203, 287, 329, 479, 556, 724, 955, 1242, 1432, 1889, 2370, 2863, 3502, 4549, 5237, 6825, 8108, 9839, 12188, 14374, 16958, 21617, 25852, 30582, 36100, 44561, 51462, 63238, 73386, 85990, 105272, 124729
Offset: 0
The a(4) = 1 through a(8) = 13 partitions:
(211) (221) (411) (322) (332)
(311) (3111) (331) (422)
(2111) (21111) (421) (431)
(511) (521)
(2221) (611)
(3211) (4211)
(4111) (5111)
(22111) (22211)
(31111) (32111)
(211111) (41111)
(221111)
(311111)
(2111111)
The complement is counted by
A240219.
A008289 counts strict partitions by mean.
A359909 counts factorizations with the same mean as median, odd-len
A359910.
-
Table[Length[Select[IntegerPartitions[n],Mean[#]!=Median[#]&]],{n,0,30}]
A360068
Number of integer partitions of n such that the parts have the same mean as the multiplicities.
Original entry on oeis.org
1, 1, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 6, 0, 0, 0, 6, 0, 7, 0, 1, 0, 0, 0, 0, 90, 0, 63, 0, 0, 0, 0, 11, 0, 0, 0, 436, 0, 0, 0, 0, 0, 0, 0, 0, 2157, 0, 0, 240, 1595, 22, 0, 0, 0, 6464, 0, 0, 0, 0, 0, 0, 0, 0, 11628, 4361, 0, 0, 0, 0, 0, 0, 0, 12927, 0, 0, 621, 0
Offset: 0
The n = 1, 4, 8, 9, 12, 16, 18 partitions (D=13):
(1) (22) (3311) (333) (322221) (4444) (444222)
(5111) (332211) (43222111) (444411)
(422211) (43321111) (552222)
(522111) (53221111) (555111)
(531111) (54211111) (771111)
(621111) (63211111) (822222)
(D11111)
For example, the partition (4,3,3,3,3,3,2,2,1,1) has mean 5/2, and its multiplicities (1,5,2,2) also have mean 5/2, so it is counted under a(20).
Positions of positive terms are
A360070.
A360069 counts partitions whose multiplicities have integer mean.
-
Table[Length[Select[IntegerPartitions[n],Mean[#]==Mean[Length/@Split[#]]&]],{n,0,30}]
Showing 1-10 of 94 results.
Comments