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 35 results. Next

A363945 Triangle read by rows where T(n,k) is the number of integer partitions of n with low mean k.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 2, 0, 1, 0, 2, 2, 0, 1, 0, 4, 2, 0, 0, 1, 0, 4, 3, 3, 0, 0, 1, 0, 7, 4, 3, 0, 0, 0, 1, 0, 7, 10, 0, 4, 0, 0, 0, 1, 0, 12, 6, 7, 4, 0, 0, 0, 0, 1, 0, 12, 16, 8, 0, 5, 0, 0, 0, 0, 1, 0, 19, 21, 10, 0, 5, 0, 0, 0, 0
Offset: 0

Views

Author

Gus Wiseman, Jun 30 2023

Keywords

Comments

Extending the terminology of A124943, the "low mean" of a multiset is its mean rounded down.

Examples

			Triangle begins:
  1
  0  1
  0  1  1
  0  2  0  1
  0  2  2  0  1
  0  4  2  0  0  1
  0  4  3  3  0  0  1
  0  7  4  3  0  0  0  1
  0  7 10  0  4  0  0  0  1
  0 12  6  7  4  0  0  0  0  1
  0 12 16  8  0  5  0  0  0  0  1
  0 19 21 10  0  5  0  0  0  0  0  1
  0 19 24 15 12  0  6  0  0  0  0  0  1
  0 30 32 18 14  0  6  0  0  0  0  0  0  1
  0 30 58 23 16  0  0  7  0  0  0  0  0  0  1
  0 45 47 57  0 19  0  7  0  0  0  0  0  0  0  1
Row k = 8 counts the following partitions:
  .  (41111)     (611)   .  (71)  .  .  .  (8)
     (32111)     (521)      (62)
     (311111)    (5111)     (53)
     (22211)     (431)      (44)
     (221111)    (422)
     (2111111)   (4211)
     (11111111)  (332)
                 (3311)
                 (3221)
                 (2222)

Crossrefs

Row sums are A000041.
Column k = 1 is A025065, ranks A363949.
For median instead of mean we have triangle A124943, high A124944.
Column k = 2 is A363745.
For median instead of mean we have rank statistic A363941, high A363942.
The rank statistic for this triangle is A363943.
The high version is A363946, rank statistic A363944.
For mode instead of mean we have A363952, rank statistic A363486.
For high mode instead of mean we have A363953, rank statistic A363487.
A008284 counts partitions by length, A058398 by mean.
A051293 counts subsets with integer mean, median A000975.
A067538 counts partitions with integer mean, strict A102627, ranks A316413.
A349156 counts partitions with non-integer mean, ranks A348551.
Cf. A002865, A026905, A237984, A327472, A327482, A344296, A362612, A363723, A363724, A363731, A363951.

Programs

  • Mathematica
    meandown[y_]:=If[Length[y]==0,0,Floor[Mean[y]]];
Table[Length[Select[IntegerPartitions[n],meandown[#]==k&]],{n,0,15},{k,0,n}]

A361394 Number of integer partitions of n where 2*(number of distinct parts) >= (number of parts).

Original entry on oeis.org

1, 1, 2, 2, 4, 6, 8, 11, 15, 20, 30, 38, 49, 65, 83, 108, 139, 178, 224, 286, 358, 437, 550, 684, 837, 1037, 1269, 1553, 1889, 2295, 2770, 3359, 4035, 4843, 5808, 6951, 8312, 9902, 11752, 13958, 16531, 19541, 23037, 27162, 31911, 37488, 43950, 51463, 60127, 70229
Offset: 0

Views

Author

Gus Wiseman, Mar 17 2023

Keywords

Examples

			The a(1) = 1 through a(7) = 11 partitions:
  (1)  (2)   (3)   (4)    (5)     (6)     (7)
       (11)  (21)  (22)   (32)    (33)    (43)
                   (31)   (41)    (42)    (52)
                   (211)  (221)   (51)    (61)
                          (311)   (321)   (322)
                          (2111)  (411)   (331)
                                  (2211)  (421)
                                  (3111)  (511)
                                          (2221)
                                          (3211)
                                          (4111)

Links

Crossrefs

The complement is counted by A360254, ranks A360558.
These partitions have ranks A361395.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by length, reverse A058398.
A067538 counts partitions with integer mean, strict A102627.
A116608 counts partitions by number of distinct parts.
Cf. A106529, A144300, A237363, A237832, A240219, A316413, A349156.

Programs

  • Maple
    b:= proc(n, i, t) option remember; `if`(n=0, `if`(t>=0, 1, 0),
     `if`(i<1, 0, add(b(n-i*j, i-1, t+`if`(j>0, 2, 0)-j), j=0..n/i)))
    end:
a:= n-> b(n$2, 0):
seq(a(n), n=0..50);  # Alois P. Heinz, Mar 19 2023
  • Mathematica
    Table[Length[Select[IntegerPartitions[n],2*Length[Union[#]]>=Length[#]&]],{n,0,30}]

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

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 0, 1, 2, 4, 0, 10, 0, 8, 16, 10, 0, 31, 0, 44, 44, 20, 0, 92, 50, 28, 98, 154, 0, 266, 0, 154, 194, 48, 434, 712, 0, 60, 348, 910, 0, 1198, 0, 1120, 2138, 88, 0, 2428, 1300, 1680, 912, 2506, 0, 4808, 4800, 5968, 1372, 140, 0, 14820, 0, 160
Offset: 1

Views

Author

Gus Wiseman, Mar 29 2023

Keywords

Comments

Also partitions satisfying (maximum) = 2*(mean).
These are partitions whose diagram has the same size as its complement (see example).

Examples

			The a(6) = 2 through a(12) = 10 partitions:
  (411)   .  (4211)  (621)     (5221)   .  (822)
  (3111)             (321111)  (5311)      (831)
                               (42211)     (6222)
                               (43111)     (6321)
                                           (6411)
                                           (422211)
                                           (432111)
                                           (441111)
                                           (32211111)
                                           (33111111)
The partition y = (6,4,1,1) has diagram:
  o o o o o o
  o o o o . .
  o . . . . .
  o . . . . .
Since the partition and its complement (shown in dots) have the same size, y is counted under a(12).

Crossrefs

For minimum instead of mean we have A118096.
For length instead of mean we have A237753.
For median instead of mean we have A361849, ranks A361856.
This is the equal case of A361851, unequal case A361852.
The strict case is A361854.
These partitions have ranks A361855.
This is the equal case of A361906, unequal case 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.
A268192 counts partitions by complement size, ranks A326844.
Cf. A111907, A116608, A188814, A237755, A237824, A237984, A240219, A326849, A327482, A349156, A359894.

Programs

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

A360242 Number of integer partitions of n where the parts do not have the same mean as the distinct parts.

Original entry on oeis.org

0, 0, 0, 0, 1, 3, 3, 9, 11, 19, 25, 43, 49, 82, 103, 136, 183, 258, 314, 435, 524, 687, 892, 1150, 1378, 1788, 2241, 2773, 3399, 4308, 5142, 6501, 7834, 9600, 11726, 14099, 16949, 20876, 25042, 30032, 35732, 43322, 51037, 61650, 72807, 86319, 102983, 122163
Offset: 0

Views

Author

Gus Wiseman, Feb 04 2023

Keywords

Examples

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

Crossrefs

The complement for multiplicities instead of distinct parts is A360068.
The complement is counted by A360243, ranks A360247.
For median instead of mean we have A360244, complement A360245.
These partitions have ranks A360246.
Sum of A360250 and A360251, ranks A360252 and 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.
A360071 counts partitions by number of parts and number of distinct parts.
A360241 counts partitions whose distinct parts have integer mean.
Cf. A051293, A067340, A240219, A316313, A326567/A326568, A326619/A326620, A326621, A349156.

Programs

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

A360243 Number of integer partitions of n where the parts have the same mean as the distinct parts.

Original entry on oeis.org

1, 1, 2, 3, 4, 4, 8, 6, 11, 11, 17, 13, 28, 19, 32, 40, 48, 39, 71, 55, 103, 105, 110, 105, 197, 170, 195, 237, 319, 257, 462, 341, 515, 543, 584, 784, 1028, 761, 973, 1153, 1606, 1261, 2137, 1611, 2368, 2815, 2575, 2591, 4393, 3798, 4602, 4663, 5777, 5121
Offset: 0

Views

Author

Gus Wiseman, Feb 04 2023

Keywords

Examples

			The a(1) = 1 through a(8) = 11 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (11111)  (51)      (61)       (62)
                                     (222)     (421)      (71)
                                     (321)     (1111111)  (431)
                                     (2211)               (521)
                                     (111111)             (2222)
                                                          (3221)
                                                          (3311)
                                                          (11111111)

Crossrefs

For multiplicities instead of distinct parts we have A360068.
The complement is counted by A360242, ranks A360246.
For median instead of mean we have A360245, complement A360244.
These partitions have ranks A360247.
Cf. A360250 and A360251, ranks A360252 and 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.
A360071 counts partitions by number of parts and number of distinct parts.
A360241 counts partitions whose distinct parts have integer mean.
Cf. A051293, A067340, A240219, A316313, A326567/A326568, A326619/A326620, A326621, A349156, A360069.

Programs

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

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

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 12, 18, 23, 31, 37, 51, 58, 75, 96, 116, 126, 184, 193, 253, 307, 346, 402, 511, 615, 678, 792, 1045, 1088, 1386, 1419, 1826, 2181, 2293, 2779, 3568, 3659, 3984, 4867, 5885, 6407, 7732, 8124, 9400, 11683, 13025, 13269, 16216, 17774, 22016
Offset: 1

Views

Author

Gus Wiseman, Mar 28 2023

Keywords

Comments

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

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)  (411)     (421)
                                     (2211)    (2221)
                                     (3111)    (3211)
                                     (21111)   (22111)
                                     (111111)  (211111)
                                               (1111111)
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).
The partition y = (5,2,1,1) has length 4 and maximum 5, and 4*5 is not <= 2*9, so y is not counted under a(9).
The partition y = (3,2,1,1) has diagram:
  o o o
  o o .
  o . .
  o . .
with complement of size 5, and 5 <= 7, so y is counted under a(7).

Crossrefs

For length instead of mean we have A237755.
For minimum instead of mean we have A237824.
For median instead of mean we have A361848.
The equal case for median is A361849, ranks A361856.
The unequal case is A361852, median A361858.
The equal case is A361853, ranks A361855.
Reversing the inequality gives A361906, unequal case 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. A111907, A237984, A240219, A324521, A324562, A327482, A349156, A360068, A360071, A360241, A361394, A361859.

Programs

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

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}]

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}]

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

Views

Author

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

Keywords

Comments

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)

Examples

			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.

Links

Crossrefs

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.

Programs

  • Mathematica
    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 *)

Formula

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)

Extensions

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

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}]
Previous Showing 11-20 of 35 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.