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-14 of 14 results.

A361850 Number of strict integer partitions of n such that the maximum is twice the median.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 2, 1, 3, 3, 4, 2, 5, 4, 7, 8, 10, 6, 11, 11, 15, 16, 21, 18, 25, 23, 28, 32, 40, 40, 51, 51, 58, 60, 73, 75, 93, 97, 113, 123, 139, 141, 164, 175, 199, 217, 248, 263, 301, 320, 356, 383, 426, 450, 511, 551, 613, 664, 737
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(7) = 1 through a(20) = 4 strict partitions (A..C = 10..12):
  421  .  .  631  632   .  841   842  843   A51    A52    A53   A54   C62
                  5321     6421       7431  7432   8531   8532  C61   9542
                                      7521  64321  8621         9541  9632
                                                   65321        9631  85421
                                                                9721
The partition (7,4,3,1) has maximum 7 and median 7/2, so is counted under a(15).
The partition (8,6,2,1) has maximum 8 and median 4, so is counted under a(17).

Crossrefs

For minimum instead of median we have A241035, non-strict A237824.
For length instead of median we have A241087, non-strict A237755.
The non-strict version is A361849, ranks A361856.
The non-strict complement is counted by A361857, ranks A361867.
A000041 counts integer partitions, strict A000009.
A000975 counts subsets with integer median.
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.
A359907 counts strict partitions with integer median
A360005 gives median of prime indices (times two), distinct A360457.
Cf. A027193, A067659, A079309, A111907, A116608, A359897, A359908, A360952, A361851, A361858, A361859, A361860.

Programs

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

A363132 Number of integer partitions of 2n such that 2*(minimum) = (mean).

Original entry on oeis.org

0, 0, 1, 2, 5, 6, 15, 14, 32, 34, 65, 55, 150, 100, 225, 237, 425, 296, 824, 489, 1267, 1133, 1809, 1254, 4018, 2142, 4499, 4550, 7939, 4564, 14571, 6841, 18285, 16047, 23408, 17495, 52545, 21636, 49943, 51182, 92516, 44582, 144872, 63260, 175318, 169232, 205353
Offset: 0

Views

Author

Gus Wiseman, May 23 2023

Keywords

Comments

Equivalently, n = (length)*(minimum).

Examples

			The a(2) = 1 through a(7) = 14 partitions:
  (31)  (321)  (62)    (32221)  (93)      (3222221)
        (411)  (3221)  (33211)  (552)     (3322211)
               (3311)  (42211)  (642)     (3332111)
               (4211)  (43111)  (732)     (4222211)
               (5111)  (52111)  (822)     (4322111)
                       (61111)  (322221)  (4331111)
                                (332211)  (4421111)
                                (333111)  (5222111)
                                (422211)  (5321111)
                                (432111)  (5411111)
                                (441111)  (6221111)
                                (522111)  (6311111)
                                (531111)  (7211111)
                                (621111)  (8111111)
                                (711111)

Crossrefs

Removing the factor 2 gives A099777.
Taking maximum instead of mean and including odd indices gives A118096.
For length instead of mean and including odd indices we have A237757.
For (maximum) = 2*(mean) see A361851, A361852, A361853, A361854, A361855.
For median instead of mean we have A361861.
These partitions have ranks A363133.
For maximum instead of minimum we have A363218.
For median instead of minimum we have A363224.
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.
A268192 counts partitions by complement size, ranks A326844.
Cf. A053263, A111907, A237753, A237755, A237824, A327482, A349156, A361906, A361907, A363134.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[2n],2*Min@@#==Mean[#]&]],{n,0,15}]
  • Python
    from sympy.utilities.iterables import partitions
def A363132(n): return sum(1 for s,p in partitions(n<<1,m=n,size=True) if n==s*min(p,default=0)) if n else 0 # Chai Wah Wu, Sep 21 2023

Extensions

a(31)-a(46) from Chai Wah Wu, Sep 21 2023

A362048 Number of integer partitions of n such that (length) <= 2*(median).

Original entry on oeis.org

1, 2, 2, 3, 4, 6, 8, 12, 15, 20, 25, 33, 41, 53, 66, 85, 105, 134, 164, 205, 250, 308, 373, 456, 549, 666, 799, 963, 1152, 1382, 1645, 1965, 2330, 2767, 3269, 3865, 4546, 5353, 6274, 7357, 8596, 10046, 11700, 13632, 15834, 18394, 21312, 24690, 28534, 32974
Offset: 1

Views

Author

Gus Wiseman, Apr 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(9) = 15 partitions:
  (1)  (2)   (3)   (4)   (5)    (6)    (7)     (8)     (9)
       (11)  (21)  (22)  (32)   (33)   (43)    (44)    (54)
                   (31)  (41)   (42)   (52)    (53)    (63)
                         (221)  (51)   (61)    (62)    (72)
                                (222)  (322)   (71)    (81)
                                (321)  (331)   (332)   (333)
                                       (421)   (422)   (432)
                                       (2221)  (431)   (441)
                                               (521)   (522)
                                               (2222)  (531)
                                               (3221)  (621)
                                               (3311)  (3222)
                                                       (3321)
                                                       (4221)
                                                       (4311)

Crossrefs

For maximum instead of median we have A237755.
For minimum instead of median we have A237800.
For maximum instead of length we have A361848.
The equal case is A362049.
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, A013580, A027193, A237824, A240219, A361394, A361851, A361856-A361860, A361867, A361868.

Programs

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

A363221 Number of strict integer partitions of n such that (length) * (maximum) <= 2n.

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 11, 14, 15, 19, 23, 26, 29, 37, 39, 49, 55, 62, 71, 84, 93, 108, 118, 141, 149, 188, 193, 217, 257, 279, 318, 369, 376, 441, 495, 572, 587, 692, 760, 811, 960, 1046, 1065, 1307, 1387, 1550, 1703, 1796, 2041, 2295, 2456, 2753, 3014
Offset: 1

Views

Author

Gus Wiseman, May 23 2023

Keywords

Comments

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

Examples

			The partition y = (4,3,1) has length 3 and maximum 4, and 3*4 <= 2*8, so y is counted under a(8). The complement of y has size 4, which is less than or equal to n = 8.

Crossrefs

The equal case for median is A361850, non-strict A361849 (ranks A361856).
The non-strict version is A361851, A361848 for median.
The equal case is A361854, non-strict A361853 (ranks A361855).
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. A111907, A237984, A240219, A241061, A241086, A324521, A324562, A349156, A360068, A360241, A361394, A361852, A361906.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Max@@#<=2*Mean[#]&]],{n,30}]
Previous Showing 11-14 of 14 results.

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

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