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 11-20 of 31 results. Next

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

Views

Author

Gus Wiseman, Feb 20 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) = 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).

Crossrefs

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.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],IntegerQ[Median[Length/@Split[#]]]&]],{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}]

A360250 Number of integer partitions of n where the parts have greater mean than the distinct parts.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 2, 2, 3, 3, 9, 5, 13, 15, 18, 20, 37, 34, 59, 51, 68, 92, 134, 121, 167, 203, 251, 282, 387, 375, 537, 561, 714, 888, 958, 1042, 1408, 1618, 1939, 2076, 2650, 2764, 3479, 3863, 4431, 5387, 6520, 6688, 8098, 9041, 10614, 12084, 14773, 15469
Offset: 0

Views

Author

Gus Wiseman, Feb 06 2023

Keywords

Examples

			The a(5) = 1 through a(12) = 5 partitions:
  (221)  .  (331)   (332)    (441)    (442)     (443)      (552)
            (2221)  (22211)  (3321)   (3331)    (551)      (4431)
                             (22221)  (222211)  (3332)     (33321)
                                                (4331)     (44211)
                                                (4421)     (2222211)
                                                (33221)
                                                (33311)
                                                (222221)
                                                (2222111)
For example, the partition y = (4,3,3,1) has mean 11/4 and distinct parts {1,3,4} with mean 8/5, so y is counted under a(11).

Crossrefs

For unequal instead of greater we have A360242, ranks A360246.
For equal instead of greater we have A360243, ranks A360247.
For less instead of greater we have A360251, ranks A360253.
These partitions have ranks A360252.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A058398 counts partitions by mean, also A327482.
A067538 counts partitions with integer mean, strict A102627, ranks A316413.
A116608 counts partitions by number of distinct parts.
A240219 counts partitions with mean equal to median, ranks A359889.
A359894 counts partitions with mean different from median, ranks A359890.
A360071 counts partitions by number of parts and number of distinct parts.
Cf. A000975, A316313, A326567/A326568, A326619/A326620, A326621, A360068, A360241, A360244, A360245.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Mean[#]>Mean[Union[#]]&]],{n,0,30}]

Formula

a(n) + A360251(n) = A360242(n).
a(n) + A360251(n) + A360243(n) = A000041(n).

A360251 Number of integer partitions of n where the parts have lesser mean than the distinct parts.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 3, 7, 9, 16, 22, 34, 44, 69, 88, 118, 163, 221, 280, 376, 473, 619, 800, 1016, 1257, 1621, 2038, 2522, 3117, 3921, 4767, 5964, 7273, 8886, 10838, 13141, 15907, 19468, 23424, 28093, 33656, 40672, 48273, 58171, 68944, 81888, 97596, 115643
Offset: 0

Views

Author

Gus Wiseman, Feb 06 2023

Keywords

Examples

			The a(4) = 1 through a(9) = 16 partitions:
  (211)  (311)   (411)    (322)     (422)      (522)
         (2111)  (3111)   (511)     (611)      (711)
                 (21111)  (3211)    (4211)     (3222)
                          (4111)    (5111)     (4221)
                          (22111)   (32111)    (4311)
                          (31111)   (41111)    (5211)
                          (211111)  (221111)   (6111)
                                    (311111)   (32211)
                                    (2111111)  (33111)
                                               (42111)
                                               (51111)
                                               (321111)
                                               (411111)
                                               (2211111)
                                               (3111111)
                                               (21111111)
For example, the partition y = (4,2,2,1) has mean 9/4 and distinct parts {1,2,4} with mean 7/3, so y is counted under a(9).

Crossrefs

For unequal instead of less we have A360242, ranks A360246.
For equal instead of less we have A360243, ranks A360247.
For greater instead of less we have A360250, ranks A360252.
These partitions have ranks A360253.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A058398 counts partitions by mean, also A327482.
A067538 counts partitions with integer mean, strict A102627, ranks A316413.
A116608 counts partitions by number of distinct parts.
A240219 counts partitions with mean equal to median, ranks A359889.
A359894 counts partitions with mean different from median, ranks A359890.
A360071 counts partitions by number of parts and number of distinct parts.
Cf. A000975, A316313, A326567/A326568, A326619/A326620, A326621, A360068, A360241, A360244, A360245.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Mean[#]

Formula

a(n) + A360250(n) = A360242(n).
a(n) + A360250(n) + A360243(n) = A000041(n).

A361906 Number of integer partitions of n such that (length) * (maximum) >= 2*n.

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 3, 5, 9, 15, 19, 36, 43, 68, 96, 125, 171, 232, 297, 418, 529, 676, 853, 1156, 1393, 1786, 2316, 2827, 3477, 4484, 5423, 6677, 8156, 10065, 12538, 15121, 17978, 22091, 26666, 32363, 38176, 46640, 55137, 66895, 79589, 92621, 111485, 133485
Offset: 1

Views

Author

Gus Wiseman, Mar 29 2023

Keywords

Comments

Also partitions such that (maximum) >= 2*(mean).
These are partitions whose complement (see example) has size >= n.

Examples

			The a(6) = 2 through a(10) = 15 partitions:
  (411)   (511)    (611)     (621)      (721)
  (3111)  (4111)   (4211)    (711)      (811)
          (31111)  (5111)    (5211)     (5221)
                   (41111)   (6111)     (5311)
                   (311111)  (42111)    (6211)
                             (51111)    (7111)
                             (321111)   (42211)
                             (411111)   (43111)
                             (3111111)  (52111)
                                        (61111)
                                        (421111)
                                        (511111)
                                        (3211111)
                                        (4111111)
                                        (31111111)
The partition y = (4,2,1,1) has length 4 and maximum 4, and 4*4 >= 2*8, so y is counted under a(8).
The partition y = (3,2,1,1) has length 4 and maximum 3, and 4*3 is not >= 2*7, so y is not counted under a(7).
The partition y = (3,2,1,1) has diagram:
  o o o
  o o .
  o . .
  o . .
with complement (shown in dots) of size 5, and 5 is not >= 7, so y is not counted under a(7).

Crossrefs

For length instead of mean we have A237752, reverse A237755.
For minimum instead of mean we have A237821, reverse A237824.
For median instead of mean we have A361859, reverse A361848.
The unequal case is A361907.
The complement is counted by A361852.
The equal case is A361853, ranks A361855.
Reversing the inequality gives A361851.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, A058398 by mean.
A051293 counts subsets with integer mean.
A067538 counts partitions with integer mean, strict A102627, ranks A316413.
A268192 counts partitions by complement size, ranks A326844.
Cf. A027193, A111907, A116608, A237984, A324521, A327482, A349156, A360068.

Programs

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

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

Original entry on oeis.org

1, 2, 9, 54, 100, 120, 125, 135, 168, 180, 189, 240, 252, 264, 280, 297, 300, 312, 336, 351, 396, 408, 440, 450, 456, 459, 468, 480, 513, 520, 528, 540, 552, 560, 588, 612, 616, 621, 624, 672, 680, 684, 696, 728, 744, 756, 760, 783, 816, 828, 837, 880, 882
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}
   54: {1,2,2,2}
  100: {1,1,3,3}
  120: {1,1,1,2,3}
  125: {3,3,3}
  135: {2,2,2,3}
  168: {1,1,1,2,4}
  180: {1,1,2,2,3}
  189: {2,2,2,4}
  240: {1,1,1,1,2,3}
For example, the prime indices of 336 are {1,1,1,1,2,4} with median 1 and multiplicities {1,1,4} with median 1, so 336 is in the sequence.

Crossrefs

For mean instead of median we have A359903, counted by A360068.
For distinct indices instead of indices we have A360453, counted by A360455.
For distinct indices instead of multiplicities: A360249, counted by A360245.
These partitions are counted by A360456.
A088529/A088530 gives mean of prime signature A124010.
A112798 lists prime indices, length A001222, sum A056239.
A240219 counts partitions with mean equal to median, ranked by A359889.
A325347 counts partitions w/ 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.
A359894 counts partitions with mean different from median, ranks A359890.
A360005 gives median of prime indices (times two).
Cf. A000975, A109297, A109298, A114638, A316413, A324570, A360244, A360248.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000],Median[prix[#]]==Median[Length/@Split[prix[#]]]&]

A361852 Number of integer partitions of n such that (length) * (maximum) < 2n.

Original entry on oeis.org

1, 2, 3, 5, 7, 9, 12, 17, 21, 27, 37, 41, 58, 67, 80, 106, 126, 153, 193, 209, 263, 326, 402, 419, 565, 650, 694, 891, 1088, 1120, 1419, 1672, 1987, 2245, 2345, 2856, 3659, 3924, 4519, 4975, 6407, 6534, 8124, 8280, 9545, 12937, 13269, 13788, 16474, 20336
Offset: 1

Views

Author

Gus Wiseman, Mar 29 2023

Keywords

Comments

Also partitions such that (maximum) < 2*(mean).

Examples

			The a(1) = 1 through a(7) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (21)   (22)    (32)     (33)      (43)
             (111)  (31)    (41)     (42)      (52)
                    (211)   (221)    (51)      (61)
                    (1111)  (311)    (222)     (322)
                            (2111)   (321)     (331)
                            (11111)  (2211)    (421)
                                     (21111)   (2221)
                                     (111111)  (3211)
                                               (22111)
                                               (211111)
                                               (1111111)
For example, the partition y = (3,2,1,1) has length 4 and maximum 3, and 4*3 < 2*7, so y is counted under a(7).

Crossrefs

For length instead of mean we have A237754.
Allowing equality gives A237755, for median A361848.
For equal median we have A361849, ranks A361856.
The equal version is A361853, ranks A361855.
For median instead of mean we have A361858.
The complement is counted by A361906.
Reversing the inequality gives A361907.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, A058398 by mean.
A051293 counts subsets with integer mean.
A067538 counts partitions with integer mean.
Cf. A027193, A111907, A116608, A237824, A237984, A324517, A327482, A349156, A360068, A360071, A361394.

Programs

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

A359904 Numbers whose prime factors and prime signature have the same mean.

Original entry on oeis.org

1, 4, 27, 400, 3125, 9072, 10800, 14580, 24057, 35721, 50625, 73984, 117760, 134400, 158976, 181440, 191488, 389376, 452709, 544000, 583680, 664848, 731136, 774400, 823543, 878592, 965888
Offset: 1

Views

Author

Gus Wiseman, Jan 25 2023

Keywords

Comments

The multiset of prime factors of n is row n of A027746.
A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization.

Examples

			The terms together with their prime factors begin:
      1: {}
      4: {2,2}
     27: {3,3,3}
    400: {2,2,2,2,5,5}
   3125: {5,5,5,5,5}
   9072: {2,2,2,2,3,3,3,3,7}
  10800: {2,2,2,2,3,3,3,5,5}
  14580: {2,2,3,3,3,3,3,3,5}
  24057: {3,3,3,3,3,3,3,11}
  35721: {3,3,3,3,3,3,7,7}
  50625: {3,3,3,3,5,5,5,5}
  73984: {2,2,2,2,2,2,2,2,17,17}

Crossrefs

The prime factors are A027746, mean A123528/A123529.
The prime signature is A124010, mean A088529/A088530.
For prime indices instead of factors we have A359903.
A058398 counts partitions by mean, see also A008284, A327482.
A067340 lists numbers whose prime signature has integer mean.
A078175 = numbers whose prime factors have integer mean, indices A316413.
A112798 = prime indices, length A001222, sum A056239, mean A326567/A326568.
A360005 gives median of prime indices (times two).
Cf. A240219, A326622, A327473, A359905, A359908, A359913, A360008, A360068.

Programs

  • Mathematica
    prifac[n_]:=If[n==1,{},Flatten[ConstantArray@@@FactorInteger[n]]];
prisig[n_]:=If[n==1,{},Last/@FactorInteger[n]];
Select[Range[1000],Mean[prifac[#]]==Mean[prisig[#]]&]

A360455 Number of integer partitions of n for which the distinct parts have the same median as the multiplicities.

Original entry on oeis.org

1, 1, 0, 0, 2, 1, 1, 0, 2, 2, 5, 8, 10, 14, 20, 19, 26, 31, 35, 41, 55, 65, 85, 102, 118, 151, 181, 201, 236, 281, 313, 365, 424, 495, 593, 688, 825, 978, 1181, 1374, 1650, 1948, 2323, 2682, 3175, 3680, 4314, 4930, 5718, 6546, 7532, 8557, 9777, 11067, 12622
Offset: 0

Views

Author

Gus Wiseman, Feb 10 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(11) = 8 partitions:
  1   .  .  22    221   3111   .  3311    333     3331     32222
            211                   41111   32211   33211    33221
                                                  42211    44111
                                                  322111   52211
                                                  511111   322211
                                                           332111
                                                           422111
                                                           3221111

Crossrefs

For mean instead of median: A114638, ranks A324570.
For parts instead of multiplicities: A360245, ranks A360249.
These partitions have ranks A360453.
For parts instead of distinct parts: A360456, ranks A360454.
A000041 counts integer partitions, strict A000009.
A116608 counts partitions by number of distinct parts.
A325347 counts partitions w/ integer median, strict A359907, ranks A359908.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A027193, A240219, A326619/A326620, A359894, A359895, A360068, A360243, A360244, A360248.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], Median[Length/@Split[#]]==Median[Union[#]]&]],{n,0,30}]

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

Original entry on oeis.org

0, 1, 1, 4, 5, 8, 12, 19, 25, 38, 51, 70, 93, 124, 162, 217, 279, 360, 462, 601, 750, 955, 1203, 1502, 1881, 2336, 2892, 3596, 4407, 5416, 6623, 8083, 9830, 11943, 14471, 17488, 21059, 25317, 30376, 36424, 43489, 51906, 61789, 73498, 87186, 103253, 122098
Offset: 1

Views

Author

Gus Wiseman, Apr 28 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.
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 = (3,3,1) is 1*3+2*3+3*1 = 12, which is not a multiple of 7, so y is counted under a(7).
The a(2) = 1 through a(7) = 12 partitions:
  (11)  (21)  (22)    (32)    (33)      (43)
              (31)    (41)    (42)      (52)
              (211)   (221)   (51)      (61)
              (1111)  (311)   (321)     (322)
                      (2111)  (411)     (331)
                              (2211)    (421)
                              (21111)   (511)
                              (111111)  (2221)
                                        (4111)
                                        (22111)
                                        (31111)
                                        (211111)

Crossrefs

For median instead of mean we have A322439 aerated, complement A362558.
The complement is counted by A362559.
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, A240219, A261079, A326622, A349156, A360068, A360069, A360241, A362051.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],!Divisible[Total[Accumulate[Reverse[#]]],n]&]],{n,30}]
Previous Showing 11-20 of 31 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.