A359893 -id:A359893 - cp's OEIS frontend

A359913 Numbers whose multiset of prime factors has integer median.

2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 37, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75, 76, 77, 78, 79, 80, 81

Offset: 1

Gus Wiseman, Jan 25 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 terms together with their prime factors begin:
   2: {2}
   3: {3}
   4: {2,2}
   5: {5}
   7: {7}
   8: {2,2,2}
   9: {3,3}
  11: {11}
  12: {2,2,3}
  13: {13}
  15: {3,5}
  16: {2,2,2,2}
  17: {17}
  18: {2,3,3}
  19: {19}
  20: {2,2,5}
  21: {3,7}
  23: {23}
  24: {2,2,2,3}

Prime factors are listed by A027746.
The complement is A072978, for prime indices A359912.
For mean instead of median we have A078175, for prime indices A316413.
For prime indices instead of factors we have A359908, counted by A325347.
Positions of even terms in A360005.
A067340 lists numbers whose prime signature has integer mean.
A112798 lists prime indices, length A001222, sum A056239.
A325347 counts partitions with integer median, strict A359907.
A326567/A326568 gives the mean of prime indices, conjugate A326839/A326840.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A067538, A175352, A348551, A359890, A359905, A360007, A360006, A360069.

Select[Range[2,100],IntegerQ[Median[Flatten[ConstantArray@@@FactorInteger[#]]]]&]

A360553 Numbers > 1 whose unordered prime signature has integer median.

Original entry on oeis.org

2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 24, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 46, 47, 49, 51, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 81, 82, 83

Offset: 1

Gus Wiseman, Feb 16 2023

nonn

First differs from A067340 in having 60.
A number's unordered prime signature (row n of A118914) is the multiset of positive exponents in its prime factorization.
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 unordered prime signature of 60 is {1,1,2}, with median 1, so 60 is in the sequence.
The unordered prime signature of 1260 is {1,1,2,2}, with median 3/2, so 1260 is not in the sequence.

For mean instead of median we have A067340, complement A070011.
Positions of even terms in A360460.
The complement is A360554 (without 1).
These partitions are counted by A360687.
- For divisors (A063655) we have A139711, complement A139710.
- For prime indices (A360005) we have A359908, complement A359912.
- For distinct prime indices (A360457) we have A360550, complement A360551.
- For distinct prime factors (A360458) we have A360552, complement A100367.
- For prime factors (A360459) we have A359913, complement A072978.
- For prime multiplicities (A360460) we have A360553, complement A360554.
- For 0-prepended differences (A360555) we have A360556, complement A360557.
A112798 lists prime indices, length A001222, sum A056239.
A124010 lists prime signature.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A359893 and A359901 count partitions by median, odd-length A359902.
A360454 = numbers whose prime indices and signature have the same median.
Cf. A000975, A026424, A078174, A078175, A316413, A326621, A360453.

Select[Range[2,100],IntegerQ[Median[Last/@FactorInteger[#]]]&]

A360687 Number of integer partitions of n whose multiplicities have integer median.

Original entry on oeis.org

1, 2, 3, 4, 5, 9, 10, 16, 22, 34, 42, 65, 80, 115, 145, 195, 240, 324, 396, 519, 635, 814, 994, 1270, 1549, 1952, 2378, 2997, 3623, 4521, 5466, 6764, 8139, 10008, 12023, 14673, 17534, 21273, 25336, 30593, 36302, 43575, 51555, 61570, 72653, 86382, 101676

Offset: 1

Gus Wiseman, Feb 20 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) = 16 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (2111)   (51)      (61)       (62)
                            (11111)  (222)     (421)      (71)
                                     (321)     (2221)     (431)
                                     (2211)    (3211)     (521)
                                     (3111)    (4111)     (2222)
                                     (111111)  (211111)   (3221)
                                               (1111111)  (3311)
                                                          (4211)
                                                          (5111)
                                                          (32111)
                                                          (221111)
                                                          (311111)
                                                          (11111111)
For example, the partition y = (3,2,2,1) has multiplicities (1,2,1), and the multiset {1,1,2} has median 1, so y is counted under a(8).

The case of an odd number of multiplicities is A090794.
For mean instead of median we have A360069, ranks A067340.
These partitions have ranks A360553.
The complement is counted by A360690, ranks A360554.
A058398 counts partitions by mean, see also A008284, A327482.
A124010 gives prime signature, sorted A118914, mean A088529/A088530.
A325347 = partitions w/ integer median, strict A359907, complement A307683.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A329976, A359908, A360068, A360460, A360550, A360556, A360688.

Table[Length[Select[IntegerPartitions[n],IntegerQ[Median[Length/@Split[#]]]&]],{n,30}]

A360688 Number of integer partitions of n with integer median of 0-appended first differences.

Original entry on oeis.org

1, 1, 3, 4, 5, 7, 12, 18, 25, 32, 46, 62, 79, 109, 142, 189, 240, 322, 405, 522, 671, 853, 1053, 1345, 1653, 2081, 2551, 3174, 3878, 4826, 5851, 7219, 8747, 10712, 12936, 15719, 18876, 22872, 27365, 32926, 39253, 47070, 55857, 66676, 79029, 93864, 110832

Offset: 1

Gus Wiseman, Feb 20 2023

nonn

Includes all partitions of odd length (A027193).

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) = 18 partitions:
  (1)  (2)  (3)    (4)     (5)      (6)       (7)        (8)
            (21)   (22)    (41)     (42)      (43)       (44)
            (111)  (211)   (221)    (222)     (61)       (62)
                   (1111)  (311)    (321)     (322)      (332)
                           (11111)  (411)     (331)      (422)
                                    (21111)   (421)      (431)
                                    (111111)  (511)      (521)
                                              (3211)     (611)
                                              (22111)    (2222)
                                              (31111)    (3221)
                                              (211111)   (4211)
                                              (1111111)  (22211)
                                                         (32111)
                                                         (41111)
                                                         (221111)
                                                         (311111)
                                                         (2111111)
                                                         (11111111)
For example, the partition y = (3,2,2,1) has 0-appended parts (3,2,2,1,0), with differences (1,0,1,1), and the multiset {0,1,1,1} has median 1, so y is counted under a(8).

The case of median 0 is A360254, ranks A360558.
These partitions have ranks A360556, complement A360557.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A325347 counts partitions w/ integer median, strict A359907, ranks A359908.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A027193, A237363, A240219, A360455, A360555.

Table[Length[Select[IntegerPartitions[n],IntegerQ[Median[Differences[Prepend[Reverse[#],0]]]]&]],{n,30}]

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

A362559 Number of integer partitions of n whose weighted sum is divisible by n.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 7, 8, 11, 14, 14, 18, 25, 28, 26, 42, 47, 52, 73, 77, 100, 118, 122, 158, 188, 219, 266, 313, 367, 412, 489, 578, 698, 809, 914, 1094, 1268, 1472, 1677, 1948, 2305, 2656, 3072, 3527, 4081, 4665, 5342, 6225, 7119, 8150, 9408

Offset: 1

Gus Wiseman, Apr 24 2023

nonn

The (one-based) weighted sum of a sequence (y_1,...,y_k) is Sum_{i=1..k} i*y_i. This is also the sum of partial sums of the reverse.
Also the number of n-multisets of positive integers that (1) have integer mean, (2) cover an initial interval, and (3) have weakly decreasing multiplicities.
Conjecture: A partition of n has weighted sum divisible by n iff its reverse has weighted sum divisible by n.

			The weighted sum of y = (4,2,2,1) is 1*4+2*2+3*2+4*1 = 18, which is a multiple of 9, so y is counted under a(9).
The a(1) = 1 through a(9) = 5 partitions:
  (1)  (2)  (3)    (4)  (5)      (6)     (7)        (8)       (9)
            (111)       (11111)  (222)   (3211)     (3311)    (333)
                                 (3111)  (1111111)  (221111)  (4221)
                                                              (222111)
                                                              (111111111)

For median instead of mean we have A362558.
The complement is counted by A362560.
A000041 counts integer partitions, strict A000009.
A008284/A058398/A327482 count partitions by mean.
A264034 counts partitions by weighted sum.
A304818 = weighted sum of prime indices, row-sums of A359361.
A318283 = weighted sum of reversed prime indices, row-sums of A358136.
Cf. A001227, A051293, A067538, A067539, A240219, A261079, A322439, A326622, A359893, A360068, A360069, A362051.

Table[Length[Select[IntegerPartitions[n], Divisible[Total[Accumulate[Reverse[#]]],n]&]],{n,30}]

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

A359909 Number of integer factorizations of n into factors > 1 with the same mean as median.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 4, 1, 3, 1, 3, 2, 2, 1, 5, 2, 2, 3, 3, 1, 4, 1, 4, 2, 2, 2, 6, 1, 2, 2, 4, 1, 4, 1, 3, 3, 2, 1, 6, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 7, 1, 2, 3, 7, 2, 4, 1, 3, 2, 4, 1, 7, 1, 2, 3, 3, 2, 4, 1, 6, 4, 2, 1, 6, 2, 2, 2, 4, 1, 6, 2, 3, 2, 2, 2, 6, 1, 3, 3, 6, 1, 4, 1, 4, 5, 2, 1, 6, 1, 4, 2, 5, 1, 4, 2, 3, 3, 2, 2, 11

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 = 24, 36, 60, 120, 144, 360:
  24      36        60      120       144       360
  3*8     4*9       2*30    2*60      2*72      4*90
  4*6     6*6       3*20    3*40      3*48      5*72
  2*12    2*18      4*15    4*30      4*36      6*60
  2*3*4   3*12      5*12    5*24      6*24      8*45
          2*2*3*3   6*10    6*20      8*18      9*40
                    3*4*5   8*15      9*16      10*36
                            10*12     12*12     12*30
                            4*5*6     2*2*6*6   15*24
                            2*6*10    3*3*4*4   18*20
                            2*3*4*5             2*180
                                                3*120
                                                2*10*18
                                                3*4*5*6

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

The version for partitions is A240219, complement A359894.
These multisets are ranked by A359889.
The version for strict partitions is A359897.
The odd-length case is A359910.
The complement is counted by A359911.
A001055 counts factorizations.
A058398 counts partitions by mean, see also A008284, A327482.
A326622 counts factorizations with integer mean, strict A328966.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A316313, A326567/A326568, A359906, 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],Mean[#]==Median[#]&]],{n,100}]

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

More terms from Antti Karttunen, Jan 20 2025

A360249 Numbers for which the prime indices have the same median as the distinct prime indices.

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, 42, 43, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 81, 82, 83, 85, 86, 87, 89, 90, 91, 93, 94, 95, 97, 100, 101, 102, 103, 105, 106, 107, 109, 110, 111, 113, 114, 115, 118, 119, 121, 122, 123, 125, 126, 127, 128, 129, 130

Offset: 1

Gus Wiseman, Feb 07 2023

nonn

First differs from A072774 in having 90.
First differs from A242414 in having 180.
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 prime indices of 126 are {1,2,2,4} with median 2 and distinct prime indices {1,2,4} with median 2, so 126 is in the sequence.
The prime indices of 180 are {1,1,2,2,3} with median 2 and distinct prime indices {1,2,3} with median 2, so 180 is in the sequence.

These partitions are counted by A360245.
The complement for mean instead of median is A360246, counted by A360242.
For mean instead of median we have A360247, counted by A360243.
The complement is A360248, counted by A360244.
For multiplicities instead of parts: A360453, counted by A360455.
For multiplicities instead of distinct parts: A360454, counted by A360456.
A112798 lists prime indices, length A001222, sum A056239.
A240219 counts partitions with mean equal to median, ranks A359889.
A326567/A326568 gives mean of prime indices.
A326619/A326620 gives mean of distinct prime indices.
A325347 = partitions with integer median, strict A359907, ranks A359908.
A359893 and A359901 count partitions by median.
A359894 = partitions with mean different from median, ranks A359890.
A360005 gives median of prime indices (times two).
Cf. A000975, A078174, A316413, A324570, A359903, A360252, A360253.

isA360249 := proc(n)
    local ifs,pidx,pe,medAll,medDist ;
    if n = 1 then
        return true ;
    end if ;
    ifs := ifactors(n)[2] ;
    pidx := [] ;
    for pe in ifs do
        numtheory[pi](op(1,pe)) ;
        pidx := [op(pidx),seq(%,i=1..op(2,pe))] ;
    end do:
    medAll := stats[describe,median](sort(pidx)) ;
    pidx := convert(convert(pidx,set),list) ;
    medDist := stats[describe,median](sort(pidx)) ;
    if medAll = medDist then
        true;
    else
        false;
    end if;
end proc:
for n from 1 to 130 do
    if isA360249(n) then
        printf("%d,",n) ;
    end if;
end do: # R. J. Mathar, May 22 2023

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

A360552 Numbers > 1 whose distinct prime factors have integer median.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 13, 15, 16, 17, 19, 21, 23, 25, 27, 29, 30, 31, 32, 33, 35, 37, 39, 41, 42, 43, 45, 47, 49, 51, 53, 55, 57, 59, 60, 61, 63, 64, 65, 66, 67, 69, 70, 71, 73, 75, 77, 78, 79, 81, 83, 84, 85, 87, 89, 90, 91, 93, 95, 97, 99, 101, 102, 103

Offset: 1

Gus Wiseman, Feb 16 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 prime factors of 900 are {2,2,3,3,5,5}, with distinct parts {2,3,5}, with median 3, so 900 is in the sequence.

For mean instead of median we have A078174, complement of A176587.
The complement is A100367 (without 1).
Positions of even terms in A360458.
- For divisors (A063655) we have A139711, complement A139710.
- For prime indices (A360005) we have A359908, complement A359912.
- For distinct prime indices (A360457) we have A360550, complement A360551.
- For distinct prime factors (A360458) we have A360552, complement A100367.
- For prime factors (A360459) we have A359913, complement A072978.
- For prime multiplicities (A360460) we have A360553, complement A360554.
- For 0-prepended differences (A360555) we have A360556, complement A360557.
A027746 lists prime factors, length A001222, indices A112798.
A027748 lists distinct prime factors, length A001221, indices A304038.
A323171/A323172 = mean of distinct prime factors, indices A326619/A326620.
A325347 = partitions w/ integer median, complement A307683, strict A359907.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A026424, A056239, A078175, A175352, A316413, A326621, A360009.

Select[Range[2,100],IntegerQ[Median[First/@FactorInteger[#]]]&]

cp's OEIS Frontend

A359913 Numbers whose multiset of prime factors has integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360553 Numbers > 1 whose unordered prime signature has integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360687 Number of integer partitions of n whose multiplicities have integer median.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360688 Number of integer partitions of n with integer median of 0-appended first differences.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A362559 Number of integer partitions of n whose weighted sum is divisible by n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

A359909 Number of integer factorizations of n into factors > 1 with the same mean as median.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions