cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 41-50 of 94 results. Next

A359906 Number of integer partitions of n with integer mean and integer median.

Original entry on oeis.org

1, 2, 2, 4, 2, 8, 2, 10, 9, 14, 2, 39, 2, 24, 51, 49, 2, 109, 2, 170, 144, 69, 2, 455, 194, 116, 381, 668, 2, 1378, 2, 985, 956, 316, 2043, 4328, 2, 511, 2293, 6656, 2, 8634, 2, 8062, 14671, 1280, 2, 26228, 8035, 15991, 11614, 25055, 2, 47201, 39810, 65092
Offset: 1

Views

Author

Gus Wiseman, Jan 21 2023

Keywords

Comments

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

Examples

			The a(1) = 1 through a(9) = 9 partitions:
  1  2   3    4     5      6       7        8         9
     11  111  22    11111  33      1111111  44        333
              31           42               53        432
              1111         51               62        441
                           222              71        522
                           321              2222      531
                           411              3221      621
                           111111           3311      711
                                            5111      111111111
                                            11111111

Crossrefs

For just integer mean we have A067538, strict A102627, ranked by A316413.
For just integer median we have A325347, strict A359907, ranked by A359908.
These partitions are ranked by A360009.
A000041 counts partitions, strict A000009.
A058398 counts partitions by mean, see also A008284, A327482.
A051293 counts subsets with integer mean, median A000975.
A326567/A326568 gives mean of prime indices.
A326622 counts factorizations with integer mean, strict A328966.
A359893/A359901/A359902 count partitions by median.
A360005(n)/2 gives median of prime indices.
Cf. A000016, A082550, A237984, A240219, A326669, A327475, A349156, A359894, A359897, A359905.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], IntegerQ[Mean[#]]&&IntegerQ[Median[#]]&]],{n,1,30}]

A361858 Number of integer partitions of n such that the maximum is less than twice the median.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 8, 12, 15, 19, 22, 31, 34, 45, 55, 67, 78, 100, 115, 144, 170, 203, 238, 291, 337, 403, 473, 560, 650, 772, 889, 1046, 1213, 1414, 1635, 1906, 2186, 2533, 2913, 3361, 3847, 4433, 5060, 5808, 6628, 7572, 8615, 9835, 11158, 12698, 14394
Offset: 1

Views

Author

Gus Wiseman, Apr 02 2023

Keywords

Comments

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

Examples

			The a(1) = 1 through a(8) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (221)    (51)      (61)       (62)
                            (11111)  (222)     (322)      (71)
                                     (321)     (331)      (332)
                                     (2211)    (2221)     (431)
                                     (111111)  (1111111)  (2222)
                                                          (3221)
                                                          (3311)
                                                          (22211)
                                                          (11111111)
The partition y = (3,2,2,1) has maximum 3 and median 2, and 3 < 2*2, so y is counted under a(8).

Crossrefs

For minimum instead of median we have A053263.
For length instead of median we have A237754.
Allowing equality gives A361848, strict A361850.
The equal version is A361849, ranks A361856.
For mean instead of median we have A361852.
Reversing the inequality gives A361857, ranks A361867.
The complement is counted by A361859, ranks A361868.
A000041 counts integer partitions, strict A000009.
A000975 counts subsets with integer median.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median.
A360005 gives twice median of prime indices, distinct A360457.
Cf. A008284, A027193, A237751, A237755, A237820, A237824, A240219, A361394, A361851, A361860, A361907.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Max@@#<2*Median[#]&]],{n,30}]

A361860 Number of integer partitions of n whose median part is the smallest.

Original entry on oeis.org

1, 2, 2, 4, 4, 7, 8, 12, 15, 21, 25, 36, 44, 58, 72, 95, 117, 150, 185, 235, 289, 362, 441, 550, 670, 824, 1000, 1223, 1476, 1795, 2159, 2609, 3126, 3758, 4485, 5369, 6388, 7609, 9021, 10709, 12654, 14966, 17632, 20782, 24414, 28684, 33601, 39364, 45996
Offset: 1

Views

Author

Gus Wiseman, Apr 02 2023

Keywords

Comments

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

Examples

			The a(1) = 1 through a(8) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (311)    (33)      (322)      (44)
                    (211)   (2111)   (222)     (511)      (422)
                    (1111)  (11111)  (411)     (4111)     (611)
                                     (3111)    (22111)    (2222)
                                     (21111)   (31111)    (5111)
                                     (111111)  (211111)   (32111)
                                               (1111111)  (41111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)

Crossrefs

For mean instead of median we have A000005.
For length instead of median we have A006141.
For maximum instead of median we have A053263.
For half-median we have A361861.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, A058398 by mean.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median, odd-length A359902.
A360005 gives twice median of prime indices, distinct A360457.
Cf. A027193, A053263, A067659, A111907, A116608, A118096, A237753, A240219, A359907, A361848, A361849.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Min@@#==Median[#]&]],{n,30}]

A360069 Number of integer partitions of n whose multiset of multiplicities has integer mean.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 9, 9, 13, 16, 25, 26, 39, 42, 62, 67, 95, 107, 147, 168, 225, 245, 327, 381, 471, 565, 703, 823, 1038, 1208, 1443, 1743, 2088, 2439, 2937, 3476, 4163, 4921, 5799, 6825, 8109, 9527, 11143, 13122, 15402, 17887, 20995, 24506, 28546, 33234, 38661
Offset: 0

Views

Author

Gus Wiseman, Jan 27 2023

Keywords

Examples

			The a(1) = 1 through a(8) = 13 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)    (4111)     (521)
                                     (3111)    (211111)   (2222)
                                     (111111)  (1111111)  (3311)
                                                          (5111)
                                                          (221111)
                                                          (311111)
                                                          (11111111)
For example,  the partition (3,2,1,1,1,1) has multiplicities (1,1,4) with mean 2, so is counted under a(9). On the other hand, the partition (3,2,2,1,1) has multiplicities (1,2,2) with mean 5/3, so is not counted under a(9).

Crossrefs

These partitions are ranked by A067340 (prime signature has integer mean).
Parts instead of multiplicities: A067538, strict A102627, ranked by A316413.
The case where the parts have integer mean also is ranked by A359905.
A000041 counts integer partitions, strict A000009.
A051293 counts subsets with integer mean, median A000975.
A058398 counts partitions by mean, see also A008284, A327482.
A088529/A088530 gives mean of prime signature (A124010).
A326622 counts factorizations with integer mean, strict A328966.
Cf. A082550, A240219, A316313, A325347, A326669, A327475, A349156, A360068.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], IntegerQ[Mean[Length/@Split[#]]]&]],{n,0,30}]

A360453 Numbers for which the prime multiplicities (or sorted signature) have the same median as the distinct prime indices.

Original entry on oeis.org

1, 2, 9, 12, 18, 40, 100, 112, 125, 180, 250, 252, 300, 352, 360, 392, 396, 405, 450, 468, 504, 540, 588, 600, 612, 675, 684, 720, 756, 792, 828, 832, 882, 900, 936, 1008, 1044, 1116, 1125, 1176, 1188, 1200, 1224, 1332, 1350, 1368, 1372, 1404, 1440, 1452, 1476
Offset: 1

Views

Author

Gus Wiseman, Feb 10 2023

Keywords

Comments

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).

Examples

			The terms together with their prime indices begin:
    1: {}
    2: {1}
    9: {2,2}
   12: {1,1,2}
   18: {1,2,2}
   40: {1,1,1,3}
  100: {1,1,3,3}
  112: {1,1,1,1,4}
  125: {3,3,3}
  180: {1,1,2,2,3}
  250: {1,3,3,3}
  252: {1,1,2,2,4}
  300: {1,1,2,3,3}
  352: {1,1,1,1,1,5}
  360: {1,1,1,2,2,3}
For example, the prime indices of 756 are {1,1,2,2,2,4} with distinct parts {1,2,4} with median 2 and multiplicities {1,2,3} with median 2, so 756 is in the sequence.

Crossrefs

Without taking median we have A109298, unordered A109297.
For mean instead of median we have A324570, counted by A114638.
For indices instead of multiplicities we have A360249, counted by A360245.
For indices instead of distinct indices we have A360454, counted by A360456.
These partitions are counted by A360455.
A088529/A088530 gives mean of prime signature A124010.
A112798 lists prime indices, length A001222, sum A056239.
A240219 counts partitions with mean equal to median, ranks A359889.
A316413 = numbers whose prime indices have integer mean, distinct A326621.
A325347 = partitions with integer median, strict A359907, ranks A359908.
A326567/A326568 gives mean of prime indices.
A326619/A326620 gives mean of distinct prime indices.
A359893 and A359901 count partitions by median.
A360005 gives median of prime indices (times two).
Cf. A000975, A359890, A359903, A360068, A360244, A360247, A360248.

Programs

  • Mathematica
    Select[Range[100],#==1||Median[Last/@FactorInteger[#]]== Median[PrimePi/@First/@FactorInteger[#]]&]

A361859 Number of integer partitions of n such that the maximum is greater than or equal to twice the median.

Original entry on oeis.org

0, 0, 0, 1, 2, 3, 7, 10, 15, 23, 34, 46, 67, 90, 121, 164, 219, 285, 375, 483, 622, 799, 1017, 1284, 1621, 2033, 2537, 3158, 3915, 4832, 5953, 7303, 8930, 10896, 13248, 16071, 19451, 23482, 28272, 33977, 40736, 48741, 58201, 69367, 82506, 97986, 116139
Offset: 1

Views

Author

Gus Wiseman, Apr 02 2023

Keywords

Comments

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

Examples

			The a(4) = 1 through a(9) = 15 partitions:
  (211)  (311)   (411)    (421)     (422)      (522)
         (2111)  (3111)   (511)     (521)      (621)
                 (21111)  (3211)    (611)      (711)
                          (4111)    (4211)     (4221)
                          (22111)   (5111)     (4311)
                          (31111)   (32111)    (5211)
                          (211111)  (41111)    (6111)
                                    (221111)   (33111)
                                    (311111)   (42111)
                                    (2111111)  (51111)
                                               (321111)
                                               (411111)
                                               (2211111)
                                               (3111111)
                                               (21111111)
The partition y = (5,2,2,1) has maximum 5 and median 2, and 5 >= 2*2, so y is counted under a(10).

Crossrefs

For length instead of median we have A237752.
For minimum instead of median we have A237821.
Reversing the inequality gives A361848.
The equal case is A361849, ranks A361856.
The unequal case is A361857, ranks A361867.
The complement is counted by A361858.
These partitions have ranks A361868.
For mean instead of median we have A361906.
A000041 counts integer partitions, strict A000009.
A000975 counts subsets with integer median.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median.
A360005 gives twice median of prime indices, distinct A360457.
Cf. A008284, A027193, A067538, A237755, A237820, A237824, A240219, A359907, A361851, A361860, A361907.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Max@@#>=2*Median[#]&]],{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

Views

Author

Gus Wiseman, Feb 20 2023

Keywords

Comments

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).

Examples

			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).

Crossrefs

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.

Programs

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

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

Views

Author

Gus Wiseman, Apr 24 2023

Keywords

Comments

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.

Examples

			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)

Crossrefs

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.

Programs

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

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

Views

Author

Gus Wiseman, Jan 24 2023

Keywords

Comments

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

Examples

			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

Links

Crossrefs

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.

Programs

  • Mathematica
    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}]
  • PARI
    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

Extensions

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

Views

Author

Gus Wiseman, Feb 07 2023

Keywords

Comments

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).

Examples

			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.

Crossrefs

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.

Programs

  • Maple
    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
  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Median[prix[#]]==Median[Union[prix[#]]]&]
Previous Showing 41-50 of 94 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.