A361866
Number of set partitions of {1..n} with block-means summing to an integer.
Original entry on oeis.org
1, 1, 1, 3, 8, 22, 75, 267, 1119, 4965, 22694, 117090, 670621, 3866503, 24113829, 161085223, 1120025702, 8121648620, 62083083115, 492273775141, 4074919882483
Offset: 0
The a(1) = 1 through a(4) = 8 set partitions:
{{1}} {{1}{2}} {{123}} {{1}{234}}
{{13}{2}} {{12}{34}}
{{1}{2}{3}} {{123}{4}}
{{13}{24}}
{{14}{23}}
{{1}{24}{3}}
{{13}{2}{4}}
{{1}{2}{3}{4}}
The set partition y = {{1,2},{3,4}} has block-means {3/2,7/2}, with sum 5, so y is counted under a(4).
For median instead of mean we have
A361911.
A308037 counts set partitions with integer mean block-size.
-
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
Table[Length[Select[sps[Range[n]],IntegerQ[Total[Mean/@#]]&]],{n,6}]
A047997
Triangle of numbers a(n,k) = number of balance positions when k equal weights are placed at a k-subset of the points {-n, -(n-1), ..., n-1, n} on a centrally pivoted rod.
Original entry on oeis.org
1, 1, 2, 1, 3, 5, 1, 4, 8, 12, 1, 5, 13, 24, 32, 1, 6, 18, 43, 73, 94, 1, 7, 25, 69, 141, 227, 289, 1, 8, 32, 104, 252, 480, 734, 910, 1, 9, 41, 150, 414, 920, 1656, 2430, 2934, 1, 10, 50, 207, 649, 1636, 3370, 5744, 8150, 9686, 1, 11, 61, 277, 967
Offset: 1
From _Gus Wiseman_, Apr 18 2023: (Start)
Triangle begins:
1
1 2
1 3 5
1 4 8 12
1 5 13 24 32
1 6 18 43 73 94
1 7 25 69 141 227 289
1 8 32 104 252 480 734 910
1 9 41 150 414 920 1656 2430 2934
Row n = 4 counts the following balanced subsets:
{0} {-1,1} {-1,0,1} {-3,0,1,2}
{-2,2} {-2,0,2} {-4,0,1,3}
{-3,3} {-3,0,3} {-2,-1,0,3}
{-4,4} {-3,1,2} {-2,-1,1,2}
{-4,0,4} {-3,-1,0,4}
{-4,1,3} {-3,-1,1,3}
{-2,-1,3} {-3,-2,1,4}
{-3,-1,4} {-3,-2,2,3}
{-4,-1,1,4}
{-4,-1,2,3}
{-4,-2,2,4}
{-4,-3,3,4}
(End)
Last column is a(n,n) =
A002838(n).
A327475 counts subsets with integer mean.
-
a[n_, k_] := Length[ IntegerPartitions[ n*(2k - n + 1)/2, n, Range[2k - n + 1]]]; Flatten[ Table[ a[n, k], {k, 1, 11}, {n, 1, k}]] (* Jean-François Alcover, Jan 02 2012 *)
Table[Length[Select[Subsets[Range[-n,n]],Length[#]==k&&Total[#]==0&]],{n,8},{k,n}] (* Gus Wiseman, Apr 16 2023 *)
A361865
Number of set partitions of {1..n} such that the mean of the means of the blocks is an integer.
Original entry on oeis.org
1, 0, 3, 2, 12, 18, 101, 232, 1547, 3768, 24974, 116728, 687419, 3489664, 26436217, 159031250, 1129056772
Offset: 1
The set partition y = {{1,4},{2,5},{3}} has block-means {5/2,7/2,3}, with mean 3, so y is counted under a(5).
The a(1) = 1 through a(5) = 12 set partitions:
{{1}} . {{123}} {{1}{234}} {{12345}}
{{13}{2}} {{123}{4}} {{1245}{3}}
{{1}{2}{3}} {{135}{24}}
{{15}{234}}
{{1}{234}{5}}
{{12}{3}{45}}
{{135}{2}{4}}
{{14}{25}{3}}
{{15}{24}{3}}
{{1}{24}{3}{5}}
{{15}{2}{3}{4}}
{{1}{2}{3}{4}{5}}
For median instead of mean we have
A361864.
A308037 counts set partitions whose block-sizes have integer mean.
-
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
Table[Length[Select[sps[Range[n]],IntegerQ[Mean[Mean/@#]]&]],{n,6}]
A327899
Number of set partitions of {1..n} with equal block sizes and equal block sums.
Original entry on oeis.org
1, 1, 1, 1, 2, 1, 2, 1, 6, 3, 2, 1, 63, 1, 2, 317, 657, 1, 4333, 1, 9609
Offset: 0
The a(8) = 6 set partitions:
{{1,2,3,4,5,6,7,8}}
{{1,2,7,8},{3,4,5,6}}
{{1,3,6,8},{2,4,5,7}}
{{1,4,5,8},{2,3,6,7}}
{{1,4,6,7},{2,3,5,8}}
{{1,8},{2,7},{3,6},{4,5}}
Set partitions with equal block-sizes are
A038041.
Set partitions with equal block-sums are
A035470.
Cf.
A000110,
A000258,
A005651,
A007837,
A008277,
A275780,
A300335,
A319189,
A326512,
A326513,
A326515,
A327908.
-
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
Table[Length[Select[sps[Range[n]],And[SameQ@@Length/@#,SameQ@@Total/@#]&]],{n,0,8}]
A361910
Number of set partitions of {1..n} such that the mean of the means of the blocks is (n+1)/2.
Original entry on oeis.org
1, 2, 3, 7, 12, 47, 99, 430, 1379, 5613, 21416, 127303, 532201, 3133846, 18776715, 114275757, 737859014
Offset: 1
The a(1) = 1 through a(5) = 12 set partitions:
{{1}} {{12}} {{123}} {{1234}} {{12345}}
{{1}{2}} {{13}{2}} {{12}{34}} {{1245}{3}}
{{1}{2}{3}} {{13}{24}} {{135}{24}}
{{14}{23}} {{15}{234}}
{{1}{23}{4}} {{1}{234}{5}}
{{14}{2}{3}} {{12}{3}{45}}
{{1}{2}{3}{4}} {{135}{2}{4}}
{{14}{25}{3}}
{{15}{24}{3}}
{{1}{24}{3}{5}}
{{15}{2}{3}{4}}
{{1}{2}{3}{4}{5}}
The set partition {{1,3},{2,4}} has means {2,3}, with mean 5/2, so is counted under a(4).
The set partition {{1,3,5},{2,4}} has means {3,3}, with mean 3, so is counted under a(5).
For median instead of mean we have
A361863.
A308037 counts set partitions with integer mean block-size.
A327475 counts subsets with integer mean,
A000975 with integer median.
A361865 counts set partitions with integer mean of means.
A361911 counts set partitions with integer sum of means.
-
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]] /@ Cases[Subsets[set],{i,_}];
Table[Length[Select[sps[Range[n]],Mean[Join@@#]==Mean[Mean/@#]&]],{n,8}]
A361863
Number of set partitions of {1..n} such that the median of medians of the blocks is (n+1)/2.
Original entry on oeis.org
1, 2, 3, 9, 26, 69, 335, 1018, 6629, 22805, 182988, 703745
Offset: 1
The a(1) = 1 through a(4) = 9 set partitions:
{{1}} {{12}} {{123}} {{1234}}
{{1}{2}} {{13}{2}} {{12}{34}}
{{1}{2}{3}} {{124}{3}}
{{13}{24}}
{{134}{2}}
{{14}{23}}
{{1}{23}{4}}
{{14}{2}{3}}
{{1}{2}{3}{4}}
The set partition {{1,4},{2,3}} has medians {5/2,5/2}, with median 5/2, so is counted under a(4).
The set partition {{1,3},{2,4}} has medians {2,3}, with median 5/2, so is counted under a(4).
For mean instead of median we have
A361910.
A361864 counts set partitions with integer median of medians, means
A361865.
A361866 counts set partitions with integer sum of medians, means
A361911.
-
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
Table[Length[Select[sps[Range[n]],(n+1)/2==Median[Median/@#]&]],{n,6}]
A361802
Irregular triangle read by rows where T(n,k) is the number of k-subsets of {-n+1,...,n} with sum 0, for k = 1,...,2n-1.
Original entry on oeis.org
1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 3, 6, 7, 5, 2, 1, 1, 4, 10, 16, 18, 14, 8, 3, 1, 1, 5, 15, 31, 46, 51, 43, 27, 12, 3, 1, 1, 6, 21, 53, 98, 139, 155, 134, 88, 43, 16, 4, 1, 1, 7, 28, 83, 184, 319, 441, 486, 424, 293, 161, 68, 21, 4, 1
Offset: 1
Triangle begins:
1
1 1 1
1 2 3 2 1
1 3 6 7 5 2 1
1 4 10 16 18 14 8 3 1
1 5 15 31 46 51 43 27 12 3 1
1 6 21 53 98 139 155 134 88 43 16 4 1
1 7 28 83 184 319 441 486 424 293 161 68 21 4 1
Row n = 3 counts the following subsets:
{0} {-1,1} {-1,0,1} {-2,-1,0,3} {-2,-1,0,1,2}
{-2,2} {-2,0,2} {-2,-1,1,2}
{-2,-1,3}
A067538 counts partitions with integer mean.
-
Table[Length[Select[Subsets[Range[-n+1,n],{k}],Total[#]==0&]],{n,6},{k,2n-1}]
Comments