A079309 -id:A079309 - cp's OEIS frontend

A231147 Array of coefficients of numerator polynomials of the rational function p(n, x + 1/x), where p(n,x) = (x^n - 1)/(x - 1).

1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 4, 3, 4, 1, 1, 1, 1, 5, 4, 9, 4, 5, 1, 1, 1, 1, 6, 5, 14, 9, 14, 5, 6, 1, 1, 1, 1, 7, 6, 20, 14, 29, 14, 20, 6, 7, 1, 1, 1, 1, 8, 7, 27, 20, 49, 29, 49, 20, 27, 7, 8, 1, 1, 1, 1, 9, 8, 35, 27, 76, 49, 99, 49, 76, 27, 35, 8, 9

Offset: 1

Clark Kimberling, Nov 05 2013

From Gus Wiseman, Mar 19 2023: (Start)
Also appears to be the number of nonempty subsets of {1,...,n} with median k, where k ranges from 1 to n in steps of 1/2, and the median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length). For example, row n = 5 counts the following subsets:
{1}  {1,2}  {2}      {1,4}      {3}          {2,5}      {4}      {4,5}  {5}
            {1,3}    {2,3}      {1,5}        {3,4}      {3,5}
            {1,2,3}  {1,2,3,4}  {2,4}        {1,3,4,5}  {1,4,5}
            {1,2,4}  {1,2,3,5}  {1,3,4}      {2,3,4,5}  {2,4,5}
            {1,2,5}             {1,3,5}                 {3,4,5}
                                {2,3,4}
                                {2,3,5}
                                {1,2,4,5}
                                {1,2,3,4,5}
Central diagonals T(n,(n+1)/2) appear to be A100066 (bisection A006134).
For mean instead of median we have A327481.
For partitions instead of subsets we have A359893, full steps A359901.
Central diagonals T(n,n/2) are A361801 (bisection A079309).
(End)

			Triangle begins:
  1
  1  1  1
  1  1  3  1  1
  1  1  4  3  4  1  1
  1  1  5  4  9  4  5  1  1
  1  1  6  5 14  9 14  5  6  1  1
  1  1  7  6 20 14 29 14 20  6  7  1  1
  1  1  8  7 27 20 49 29 49 20 27  7  8  1  1
  1  1  9  8 35 27 76 49 99 49 76 27 35  8  9  1  1
First 3 polynomials: 1, 1 + x + x^2, 1 + x + 3*x^2 + x^3 + x^4

John Tyler Rascoe, Rows n = 1..100, flattened

Cf. A231148.
Row sums are 2^n-1 = A000225(n).
Row lengths are 2n-1 = A005408(n-1).
Removing every other column appears to give A013580.
Cf. A006134, A007318, A008289, A079309, A325347, A327481, A359907, A360005.

z = 60; p[n_, x_] := p[x] = (x^n - 1)/(x - 1); Table[p[n, x], {n, 1, z/4}]; f1[n_, x_] := f1[n, x] = Numerator[Factor[p[n, x] /. x -> x + 1/x]]; Table[Expand[f1[n, x]], {n, 0, z/4}]
Flatten[Table[CoefficientList[f1[n, x], x], {n, 1, z/4}]]

A231147_row(n) = {Vecrev(Vec(numerator((-1+(x+(1/x))^n)/(x+(1/x)-1))))} \\ John Tyler Rascoe, Sep 10 2024

A361801 Number of nonempty subsets of {1..n} with median n/2.

Original entry on oeis.org

0, 0, 1, 1, 4, 4, 14, 14, 49, 49, 175, 175, 637, 637, 2353, 2353, 8788, 8788, 33098, 33098, 125476, 125476, 478192, 478192, 1830270, 1830270, 7030570, 7030570, 27088870, 27088870, 104647630, 104647630, 405187825, 405187825, 1571990935, 1571990935

Offset: 0

Gus Wiseman, Apr 07 2023

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 subset {1,2,3,5} of {1..5} has median 5/2, so is counted under a(5).
The subset {2,3,5} of {1..6} has median 6/2, so is counted under a(6).
The a(0) = 0 through a(7) = 14 subsets:
  .  .  {1}  {1,2}  {2}      {1,4}      {3}          {1,6}
                    {1,3}    {2,3}      {1,5}        {2,5}
                    {1,2,3}  {1,2,3,4}  {2,4}        {3,4}
                    {1,2,4}  {1,2,3,5}  {1,3,4}      {1,2,5,6}
                                        {1,3,5}      {1,2,5,7}
                                        {1,3,6}      {1,3,4,5}
                                        {2,3,4}      {1,3,4,6}
                                        {2,3,5}      {1,3,4,7}
                                        {2,3,6}      {2,3,4,5}
                                        {1,2,4,5}    {2,3,4,6}
                                        {1,2,4,6}    {2,3,4,7}
                                        {1,2,3,4,5}  {1,2,3,4,5,6}
                                        {1,2,3,4,6}  {1,2,3,4,5,7}
                                        {1,2,3,5,6}  {1,2,3,4,6,7}

A bisection is A079309.
The case with n's has bisection A057552.
The case without n's is A100066, bisection A006134.
A central diagonal of A231147.
A version for partitions is A361849.
For mean instead of median we have A362046.
A000975 counts subsets with integer median, for mean A327475.
A007318 counts subsets by length.
A013580 appears to count subsets by median, by mean A327481.
A360005(n)/2 represents the median statistic for partitions.
Cf. A024718, A325347, A359893, A361654, A361864, A361866, A361911.

Table[Length[Select[Subsets[Range[n]],Median[#]==n/2&]],{n,0,10}]

a(n) = A079309(floor(n/2)). - Alois P. Heinz, Apr 11 2023

A070925 Number of subsets of A = {1,2,...,n} that have the same center of gravity as A, i.e., (n+1)/2.

Original entry on oeis.org

1, 1, 3, 3, 7, 7, 19, 17, 51, 47, 151, 137, 471, 427, 1519, 1391, 5043, 4651, 17111, 15883, 59007, 55123, 206259, 193723, 729095, 688007, 2601639, 2465133, 9358943, 8899699, 33904323, 32342235, 123580883, 118215779, 452902071, 434314137, 1667837679, 1602935103

Offset: 1

Sharon Sela (sharonsela(AT)hotmail.com), May 20 2002

nonn

From Gus Wiseman, Apr 15 2023: (Start)
Also the number of nonempty subsets of {0..n} with mean n/2. The a(0) = 1 through a(5) = 7 subsets are:
  {0}  {0,1}  {1}      {0,3}      {2}          {0,5}
              {0,2}    {1,2}      {0,4}        {1,4}
              {0,1,2}  {0,1,2,3}  {1,3}        {2,3}
                                  {0,2,4}      {0,1,4,5}
                                  {1,2,3}      {0,2,3,5}
                                  {0,1,3,4}    {1,2,3,4}
                                  {0,1,2,3,4}  {0,1,2,3,4,5}
(End)

			Of the 32 (2^5) sets which can be constructed from the set A = {1,2,3,4,5} only the sets {3}, {2, 3, 4}, {2, 4}, {1, 2, 4, 5}, {1, 2, 3, 4, 5}, {1, 3, 5}, {1, 5} give an average of 3.

Fausto A. C. Cariboni, Table of n, a(n) for n = 1..40

The odd bisection is A000980(n) - 1 = 2*A047653(n) - 1.
For median instead of mean we have A100066, bisection A006134.
Including the empty set gives A222955.
The one-based version is A362046, even bisection A047653(n) - 1.
A007318 counts subsets by length.
A067538 counts partitions with integer mean, strict A102627.
A231147 counts subsets by median.
A327481 counts subsets by integer mean.
Cf. A024718, A057552, A079309, A133406, A326512, A326513, A326537, A327475, A349156, A359893.

Needs["DiscreteMath`Combinatorica`"]; f[n_] := Block[{s = Subsets[n], c = 0, k = 2}, While[k < 2^n + 1, If[ (Plus @@ s[[k]]) / Length[s[[k]]] == (n + 1)/2, c++ ]; k++ ]; c]; Table[ f[n], {n, 1, 20}]
(* second program *)
Table[Length[Select[Subsets[Range[0,n]],Mean[#]==n/2&]],{n,0,10}] (* Gus Wiseman, Apr 15 2023 *)

From Gus Wiseman, Apr 18 2023: (Start)
a(2n+1) = A000980(n) - 1.
a(n) = A222955(n) - 1.
a(n) = 2*A362046(n) + 1.
(End)

Edited by Robert G. Wilson v and John W. Layman, May 25 2002

a(34)-a(38) from Fausto A. C. Cariboni, Oct 08 2020

A362046 Number of nonempty subsets of {1..n} with mean n/2.

Original entry on oeis.org

0, 0, 1, 1, 3, 3, 9, 8, 25, 23, 75, 68, 235, 213, 759, 695, 2521, 2325, 8555, 7941, 29503, 27561, 103129, 96861, 364547, 344003, 1300819, 1232566, 4679471, 4449849, 16952161, 16171117, 61790441, 59107889, 226451035, 217157068, 833918839, 801467551, 3084255127

Offset: 0

Gus Wiseman, Apr 12 2023

nonn

			The a(2) = 1 through a(7) = 8 subsets:
  {1}  {1,2}  {2}      {1,4}      {3}          {1,6}
              {1,3}    {2,3}      {1,5}        {2,5}
              {1,2,3}  {1,2,3,4}  {2,4}        {3,4}
                                  {1,2,6}      {1,2,4,7}
                                  {1,3,5}      {1,2,5,6}
                                  {2,3,4}      {1,3,4,6}
                                  {1,2,3,6}    {2,3,4,5}
                                  {1,2,4,5}    {1,2,3,4,5,6}
                                  {1,2,3,4,5}

Using range 0..n gives A070925.
Including the empty set gives A133406.
Even bisection is A212352.
For median instead of mean we have A361801, the doubling of A079309.
A version for partitions is A361853, for median A361849.
A000980 counts nonempty subsets of {1..2n-1} with mean n.
A007318 counts subsets by length.
A067538 counts partitions with integer mean, strict A102627.
A231147 appears to count subsets by median, full-steps A013580.
A327475 counts subsets with integer mean, A000975 integer median.
A327481 counts subsets by integer mean.
Cf. A006134, A024718, A057552, A349156, A359893, A361654, A361864.

Table[Length[Select[Subsets[Range[n]],Mean[#]==n/2&]],{n,0,15}]

a(n) = (A070925(n) - 1)/2.
a(n) = A133406(n) - 1.
a(2n) = A212352(n) = A000980(n)/2 - 1.

A361654 Triangle read by rows where T(n,k) is the number of nonempty subsets of {1,...,2n-1} with median n and minimum k.

Original entry on oeis.org

1, 2, 1, 5, 3, 1, 15, 9, 4, 1, 50, 29, 14, 5, 1, 176, 99, 49, 20, 6, 1, 638, 351, 175, 76, 27, 7, 1, 2354, 1275, 637, 286, 111, 35, 8, 1, 8789, 4707, 2353, 1078, 441, 155, 44, 9, 1, 33099, 17577, 8788, 4081, 1728, 650, 209, 54, 10, 1

Offset: 1

Gus Wiseman, Mar 23 2023

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

			Triangle begins:
     1
     2     1
     5     3     1
    15     9     4     1
    50    29    14     5     1
   176    99    49    20     6     1
   638   351   175    76    27     7     1
  2354  1275   637   286   111    35     8     1
  8789  4707  2353  1078   441   155    44     9     1
Row n = 4 counts the following subsets:
  {1,7}            {2,6}        {3,5}    {4}
  {1,4,5}          {2,4,5}      {3,4,5}
  {1,4,6}          {2,4,6}      {3,4,6}
  {1,4,7}          {2,4,7}      {3,4,7}
  {1,2,6,7}        {2,3,5,6}
  {1,3,5,6}        {2,3,5,7}
  {1,3,5,7}        {2,3,4,5,6}
  {1,2,4,5,6}      {2,3,4,5,7}
  {1,2,4,5,7}      {2,3,4,6,7}
  {1,2,4,6,7}
  {1,3,4,5,6}
  {1,3,4,5,7}
  {1,3,4,6,7}
  {1,2,3,5,6,7}
  {1,2,3,4,5,6,7}

Andrew Howroyd, Table of n, a(n) for n = 1..1275 (rows 1..50)
Paul Barry, A Riordan array family for some integrable lattice models, arXiv:2409.09547 [math.CO], 2024. See p. 7.
Paul Barry, Extensions of Riordan Arrays and Their Applications, Mathematics (2025) Vol. 13, No. 2, 242. See p. 12.

Row sums appear to be A006134.
Column k = 1 appears to be A024718.
Column k = 2 appears to be A006134.
Column k = 3 appears to be A079309.
A000975 counts subsets with integer median, mean A327475.
A007318 counts subsets by length.
A231147 counts subsets by median, full steps A013580, by mean A327481.
A359893 and A359901 count partitions by median.
A360005(n)/2 gives the median statistic.
Cf. A006134, A057552, A067659, A325347, A359907, A361849.

Table[Length[Select[Subsets[Range[2n-1]],Min@@#==k&&Median[#]==n&]],{n,6},{k,n}]

T(n,k) = sum(j=0, n-k, binomial(2*j+k-2, j)) \\ Andrew Howroyd, Apr 09 2023

T(n,k) = 1 + Sum_{j=1..n-k} binomial(2*j+k-2, j). - Andrew Howroyd, Apr 09 2023

A361864 Number of set partitions of {1..n} whose block-medians have integer median.

Original entry on oeis.org

1, 0, 3, 6, 30, 96, 461, 2000, 10727, 57092, 342348

Offset: 1

Gus Wiseman, Apr 04 2023

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(4) = 6 set partitions:
  {{1}}  .  {{123}}      {{1}{234}}
            {{13}{2}}    {{123}{4}}
            {{1}{2}{3}}  {{1}{2}{34}}
                         {{12}{3}{4}}
                         {{1}{24}{3}}
                         {{13}{2}{4}}
The set partition {{1,2},{3},{4}} has block-medians {3/2,3,4}, with median 3, so is counted under a(4).

For mean instead of median we have A361865.
For sum instead of outer median we have A361911, means A361866.
A000110 counts set partitions.
A000975 counts subsets with integer median, mean A327475.
A013580 appears to count subsets by median, A327481 by mean.
A308037 counts set partitions with integer average block-size.
A325347 counts partitions w/ integer median, complement A307683.
A360005 gives twice median of prime indices, distinct A360457.
Cf. A007837, A035470, A038041, A275714, A275780, A326512, A326513.
Cf. A027193, A067659, A079309, A231147, A359893, A359907, A361801.

sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
Table[Length[Select[sps[Range[n]],IntegerQ[Median[Median/@#]]&]],{n,6}]

A133406 Half the number of ways of placing up to n pawns on a length n chessboard row so that the row balances at its middle.

Original entry on oeis.org

1, 1, 2, 2, 4, 4, 10, 9, 26, 24, 76, 69, 236, 214, 760, 696, 2522, 2326, 8556, 7942, 29504, 27562, 103130, 96862, 364548, 344004, 1300820, 1232567, 4679472, 4449850, 16952162, 16171118, 61790442, 59107890, 226451036, 217157069, 833918840

Offset: 1

R. H. Hardin, Nov 24 2007

nonn

Odd-indexed terms are A047653.

Also the number of subsets of {1..n-1} that are empty or have mean (n-1)/2. - Gus Wiseman, Apr 23 2023

			From _Gus Wiseman_, Apr 23 2023: (Start)
The a(1) = 1 through a(8) = 9 subsets:
  {}  {}  {}   {}     {}       {}         {}           {}
          {1}  {1,2}  {2}      {1,4}      {3}          {1,6}
                      {1,3}    {2,3}      {1,5}        {2,5}
                      {1,2,3}  {1,2,3,4}  {2,4}        {3,4}
                                          {1,2,6}      {1,2,4,7}
                                          {1,3,5}      {1,2,5,6}
                                          {2,3,4}      {1,3,4,6}
                                          {1,2,3,6}    {2,3,4,5}
                                          {1,2,4,5}    {1,2,3,4,5,6}
                                          {1,2,3,4,5}
(End)

Andrew Howroyd, Table of n, a(n) for n = 1..500

Cf. A047653, A133413, A133414.
For median instead of mean we have A361801 + 1, the doubling of A024718.
Not counting the empty set gives A362046 (shifted left).
A007318 counts subsets by length, A327481 by integer mean.
A047653 counts subsets of {1..2n} with mean n, nonempty A212352.
A070925 counts subsets of {1..2n-1} with mean n, nonempty A000980.
A327475 counts subsets with integer mean, nonempty A051293.
Cf. A000975, A002838, A047997, A057552, A079309.

Table[Length[Select[Subsets[Range[n]],Length[#]==0||Mean[#]==n/2&]],{n,0,10}] (* Gus Wiseman, Apr 23 2023 *)

a(n) = {polcoef(prod(k=1, n, 1 + 'x^(2*k-n-1)), 0)/2} \\ Andrew Howroyd, Jan 07 2023

From Gus Wiseman, Apr 23 2023: (Start)
a(2n+1) = A000980(n)/2 = A047653(n).
a(n) = A362046(n-1) + 1.
(End)

A212352 Row sums of A047997.

Original entry on oeis.org

0, 1, 3, 9, 25, 75, 235, 759, 2521, 8555, 29503, 103129, 364547, 1300819, 4679471, 16952161, 61790441, 226451035, 833918839, 3084255127, 11451630043, 42669225171, 159497648599, 597950875255, 2247724108771, 8470205600639

Offset: 0

N. J. A. Sloane, May 16 2012

nonn

Also the number of nonempty subsets of {1..2n} with mean n, even bisection of A362046. - Gus Wiseman, Apr 15 2023

			From _Gus Wiseman_, Apr 15 2023: (Start)
The a(1) = 1 through a(3) = 9 subsets:
  {1}  {2}      {3}
       {1,3}    {1,5}
       {1,2,3}  {2,4}
                {1,2,6}
                {1,3,5}
                {2,3,4}
                {1,2,3,6}
                {1,2,4,5}
                {1,2,3,4,5}
(End)

Equals A047653(n) - 1.
Row sums of A047997.
For median instead of mean we have A079309, bisection of A361801.
Even bisection of A362046, zero-based version A070925.
A000980 counts nonempty subsets of {1..2n-1} with mean n.
A007318 counts subsets by length.
A327475 counts subsets with integer mean.
A327481 counts subsets by mean.
Cf. A000975, A013580, A024718, A057552, A133406, A361866.

Table[Length[Select[Subsets[Range[2n]],Mean[#]==n&]],{n,0,6}] (* Gus Wiseman, Apr 15 2023 *)

From Gus Wiseman, Apr 15 2023: (Start)
a(n) = A000980(n)/2 - 1.
a(n) = A047653(n) - 1.
a(n) = A133406(2n+1) - 1.
a(n) = A362046(2n).
(End)

A025178 First differences of the central trinomial coefficients A002426.

Original entry on oeis.org

0, 2, 4, 12, 32, 90, 252, 714, 2032, 5814, 16700, 48136, 139152, 403286, 1171380, 3409020, 9938304, 29017878, 84844044, 248382516, 727971360, 2135784798, 6272092596, 18435108258, 54228499920, 159636389850, 470256930052, 1386170197704

Offset: 1

Clark Kimberling

Previous name was: "a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is an integer, s(0) = 0 = s(n), |s(1)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n), where T is the array defined in A025177."

Note that n-1 divides a(n) for n>=2. - T. D. Noe, Mar 16 2005

G. C. Greubel, Table of n, a(n) for n = 1..1000

Cf. A001006, A002426, A005717, A007971, A025177, A079309, A097893, A105696, A162551.

a := n -> 2*(n-1)*hypergeom([1-n/2, 3/2-n/2], [2], 4):
seq(simplify(a(n)), n=1..28); # Peter Luschny, Oct 29 2015

Rest[Differences[CoefficientList[Series[x/Sqrt[1-2x-3x^2],{x,0,30}],x]]] (* Harvey P. Dale, Aug 22 2011 *)
Differences[Table[Hypergeometric2F1[(1-n)/2,1-n/2,1,4],{n,1,29}]] (* Peter Luschny, Nov 03 2015 *)

a(n) = sum(k=1, n\2, binomial(n-1,2*k-1)*binomial(2*k,k)); \\ Altug Alkan, Oct 29 2015

def a():
    b, c, n = 0, 2, 2
    yield b
    while True:
        yield c
        b, c = c, ((2*n-1)*c+3*(n-1)*b)*n//((n+1)*(n-1))
        n += 1
A025178 = a()
print([next(A025178) for  in (1..20)]) # _Peter Luschny, Nov 04 2015

a(n) = T(n,n) for n>=1, where T is the array defined in A025177.
a(n) = A002426(n+1) - A002426(n). - Benoit Cloitre, Nov 02 2002
a(n) is asymptotic to c*3^n/sqrt(n) with c around 1.02... - Benoit Cloitre, Nov 02 2002
a(n) = 2*(n-1)*A001006(n-2). - M. F. Hasler, Oct 24 2011
a(n) = 2*A005717(n-1). - R. J. Mathar, Jul 09 2012
E.g.f. Integral(Integral(2*exp(x)*((1-1/x)*BesselI(1,2*x) + 2*BesselI(0,2*x)))). - Sergei N. Gladkovskii, Aug 16 2012
G.f.: -1/x + (1/x-1)/sqrt(1-2*x-3*x^2). - Sergei N. Gladkovskii, Aug 16 2012
D-finite with recurrence: a(n) = ((2+n)*a(n-2)+3*(3-n)*a(n-3)+3*(n-1)*a(n-1))/n, a(0)=1, a(1)=0, a(2)=2. - Sergei N. Gladkovskii, Aug 16 2012 [adapted to new offset by Peter Luschny, Nov 04 2015]
G.f.: (1-x)/x^2*G(0) - 1/x^2 , where G(k)= 1 + x*(2+3*x)*(4*k+1)/( 4*k+2 - x*(2+3*x)*(4*k+2)*(4*k+3)/(x*(2+3*x)*(4*k+3) + 4*(k+1)/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jul 06 2013
From Peter Bala, Oct 28 2015: (Start)
a(n) = Sum_{k = 0..floor(n/2)} binomial(n-1,2*k-1)*binomial(2*k,k). Cf. A097893.
n*(n-2)*a(n) = (2*n-3)*(n-1)*a(n-1) + 3*(n-1)*(n-2)*a(n-2) with a(1) = 0, a(2) = 2. (End)
From Peter Luschny, Oct 29 2015: (Start)
a(n) = 2*(n-1)*hypergeom([1-n/2,3/2-n/2],[2],4).
a(n) = (n-1)!*[x^(n-1)](2*exp(x)*BesselI(1,2*x)).
a(n) = (n-1)*A007971(n) for n>=2.
A105696(n) = a(n-1) + a(n) for n>=2.
A162551(n-2) = (1/2)*Sum_{k=1..n} binomial(n,k)*a(k) for n>=2.
A079309(n) = (1/2)*Sum_{k=1..2*n} (-1)^k*binomial(2*n,k)*a(k) for n>=1.
(End)

New name based on a comment by T. D. Noe, Mar 16 2005, offset set to 1 and a(1) = 0 prepended by Peter Luschny, Nov 04 2015

A361911 Number of set partitions of {1..n} with block-medians summing to an integer.

Original entry on oeis.org

1, 1, 3, 10, 30, 107, 479, 2249, 11173, 60144, 351086, 2171087, 14138253, 97097101, 701820663, 5303701310, 41838047938, 343716647215, 2935346815495, 25999729551523, 238473713427285, 2261375071834708, 22141326012712122, 223519686318676559, 2323959300370456901

Offset: 1

Gus Wiseman, Apr 14 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(4) = 10 set partitions:
  {{1}}  {{1}{2}}  {{123}}      {{1}{234}}
                   {{13}{2}}    {{12}{34}}
                   {{1}{2}{3}}  {{123}{4}}
                                {{124}{3}}
                                {{13}{24}}
                                {{134}{2}}
                                {{14}{23}}
                                {{1}{24}{3}}
                                {{13}{2}{4}}
                                {{1}{2}{3}{4}}
The set partition {{1,4},{2,3}} has medians {5/2,5/2}, with sum 5, so is counted under a(4).

For median instead of sum we have A361864.
For mean of means we have A361865.
For mean instead of median we have A361866.
A000110 counts set partitions.
A000975 counts subsets with integer median, mean A327475.
A013580 appears to count subsets by median, A327481 by mean.
A308037 counts set partitions with integer average block-size.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A360005 gives twice median of prime indices, distinct A360457.
Cf. A007837, A035470, A038041, A079309, A231147, A275714, A275780, A359893, A361801, A361910.

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[Median/@#]]&]],{n,10}]

a(12)-a(25) from Christian Sievers, Aug 26 2024

cp's OEIS Frontend

A231147 Array of coefficients of numerator polynomials of the rational function p(n, x + 1/x), where p(n,x) = (x^n - 1)/(x - 1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A361801 Number of nonempty subsets of {1..n} with median n/2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A070925 Number of subsets of A = {1,2,...,n} that have the same center of gravity as A, i.e., (n+1)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A362046 Number of nonempty subsets of {1..n} with mean n/2.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A361654 Triangle read by rows where T(n,k) is the number of nonempty subsets of {1,...,2n-1} with median n and minimum k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A361864 Number of set partitions of {1..n} whose block-medians have integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A133406 Half the number of ways of placing up to n pawns on a length n chessboard row so that the row balances at its middle.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A212352 Row sums of A047997.

Views

Author

Keywords