A325242 -id:A325242 - cp's OEIS frontend

A325415 Number of distinct sums of omega-sequences of integer partitions of n.

1, 1, 2, 3, 4, 5, 8, 8, 10, 11, 13, 12, 15, 14, 16, 18, 18, 18, 21, 20, 23, 23, 24, 24, 27, 27, 28, 29, 30, 30, 34, 32, 34, 35, 36, 37, 39, 38, 40, 41, 43, 42, 45, 44, 46, 48, 48, 48, 51, 50, 53, 53, 54, 54, 57, 57, 58, 59, 60, 60, 64

Offset: 0

Gus Wiseman, Apr 24 2019

nonn

The omega-sequence of an integer partition is the sequence of lengths of the multisets obtained by repeatedly taking the multiset of multiplicities until a singleton is reached. For example, the partition (32211) has chain of multisets of multiplicities {1,1,2,2,3} -> {1,2,2} -> {1,2} -> {1,1} -> {2}, so its omega-sequence is (5,3,2,2,1) with sum 13.

			The partitions of 9 organized by sum of omega sequence (first column) are:
   1: (9)
   4: (333)
   5: (81) (72) (63) (54)
   7: (621) (531) (432)
   8: (711) (522) (441)
   9: (6111) (3222) (222111)
  10: (51111) (33111) (22221) (111111111)
  11: (411111)
  12: (5211) (4311) (4221) (3321) (3111111) (2211111)
  13: (42111) (32211) (21111111)
  14: (321111)
There are a total of 11 distinct sums {1,4,5,7,8,9,10,11,12,13,14}, so a(9) = 11.

Number of nonzero terms in row n of A325414.
Cf. A181819, A225486, A323014, A323023, A325238, A325248, A325249, A325277, A325412, A325413, A325416.
Integer partition triangles: A008284 (first omega), A116608 (second omega), A325242 (third omega), A325268 (second-to-last omega), A225485 or A325280 (frequency depth), A325414 (omega-sequence sum).

omseq[ptn_List]:=If[ptn=={},{},Length/@NestWhileList[Sort[Length/@Split[#]]&,ptn,Length[#]>1&]];
Table[Length[Union[Total/@omseq/@IntegerPartitions[n]]],{n,0,30}]

A325412 Number of distinct omega-sequences of integer partitions of n.

Original entry on oeis.org

1, 1, 2, 3, 5, 5, 10, 9, 14, 15, 20, 21, 33, 30, 39, 45, 54, 54, 69, 68, 85, 90, 100, 104, 128, 127, 141, 153, 172, 175, 205, 203, 229, 240, 257, 274, 308, 309, 335, 356, 390, 395, 437, 444, 481, 506, 530, 549, 602, 609, 648, 672, 710, 727, 777, 798, 848, 871

Offset: 0

Gus Wiseman, Apr 24 2019

nonn

The omega-sequence of an integer partition is the sequence of lengths of the multisets obtained by repeatedly taking the multiset of multiplicities until a singleton is reached. For example, the partition (32211) has chain of multisets of multiplicities {1,1,2,2,3} -> {1,2,2} -> {1,2} -> {1,1} -> {2}, so its omega-sequence is (5,3,2,2,1).

			The a(1) = 1 through a(9) = 15 omega-sequences:
  (1)  (1)   (1)    (1)     (1)     (1)     (1)      (1)      (1)
       (21)  (31)   (21)    (51)    (21)    (71)     (21)     (31)
             (221)  (41)    (221)   (31)    (221)    (41)     (91)
                    (221)   (3221)  (61)    (331)    (81)     (221)
                    (3221)  (4221)  (221)   (3221)   (221)    (331)
                                    (331)   (4221)   (331)    (621)
                                    (421)   (5221)   (421)    (3221)
                                    (3221)  (6221)   (3221)   (4221)
                                    (4221)  (43221)  (4221)   (5221)
                                    (5221)           (5221)   (6221)
                                                     (6221)   (7221)
                                                     (7221)   (8221)
                                                     (43221)  (43221)
                                                     (53221)  (53221)
                                                              (63221)

Cf. A181819, A225486, A323014, A323023, A325238, A325248, A325277, A325413, A325415.

Integer partition triangles: A008284 (first omega), A116608 (second omega), A325242 (third omega), A325268 (second-to-last omega), A225485 or A325280 (frequency depth), A325414 (omega-sequence sum).

omseq[ptn_List]:=If[ptn=={},{},Length/@NestWhileList[Sort[Length/@Split[#]]&,ptn,Length[#]>1&]];
Table[Length[Union[omseq/@IntegerPartitions[n]]],{n,0,30}]

A353843 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with partition run-sum trajectory ending in a partition of length k. All zeros removed.

Original entry on oeis.org

1, 1, 2, 2, 1, 4, 1, 2, 5, 5, 5, 1, 2, 12, 1, 8, 11, 3, 3, 19, 8, 5, 27, 9, 1, 2, 34, 19, 1, 15, 26, 34, 2, 2, 49, 45, 5, 5, 68, 48, 14, 4, 58, 98, 15, 1, 18, 76, 105, 31, 1, 2, 88, 159, 46, 2, 13, 98, 191, 79, 4, 2, 114, 261, 105, 8, 14, 148, 282, 164, 19

Offset: 0

Gus Wiseman, Jun 04 2022

The partition run-sum trajectory is obtained by repeatedly taking the run-sums until a strict partition is reached. For example, the trajectory of y = (3,2,1,1,1) is (3,2,1,1,1) -> (3,3,2) -> (6,2), so y is counted under T(8,2).

			Triangle begins:
   1
   1
   2
   2  1
   4  1
   2  5
   5  5  1
   2 12  1
   8 11  3
   3 19  8
   5 27  9  1
   2 34 19  1
  15 26 34  2
   2 49 45  5
   5 68 48 14
   4 58 98 15  1
For example, row n = 8 counts the following partitions:
  (8)         (53)       (431)
  (44)        (62)       (521)
  (422)       (71)       (3221)
  (2222)      (332)
  (4211)      (611)
  (41111)     (3311)
  (221111)    (5111)
  (11111111)  (22211)
              (32111)
              (311111)
              (2111111)

Row sums are A000041.
Row-lengths are A003056.
The last part of the same trajectory is A353842.
Column k = 1 is A353845, compositions A353858.
The length of the trajectory is A353846.
The version for compositions is A353856.
A275870 counts collapsible partitions, ranked by A300273.
A304442 counts partitions with constant run-sums, ranked by A353833/A353834.
A325268 counts partitions by omicron, rank statistic A304465.
A353837 counts partitions with all distinct run-sums, ranked by A353838.
A353840-A353846 pertain to partition run-sum trajectory.
A353847 represents the run-sums of a composition, partitions A353832.
A353864 counts rucksack partitions, ranked by A353866.
A353865 counts perfect rucksack partitions, ranked by A353867.
A353932 lists run-sums of standard compositions.
Cf. A008284, A116608, A325242, A325268, A225485 or A325280.
Cf. A047966, A237685, A325277, A353841, A353853-A353859.

Table[Length[Select[IntegerPartitions[n], Length[FixedPoint[Sort[Total/@Split[#]]&,#]]==k&]],{n,0,15},{k,0,n}]

A325243 Number of integer partitions of n with exactly two distinct multiplicities.

Original entry on oeis.org

0, 0, 0, 0, 1, 3, 3, 9, 12, 19, 26, 39, 47, 70, 89, 115, 148, 189, 235, 294, 362, 450, 558, 669, 817, 980, 1197, 1421, 1709, 2012, 2429, 2836, 3380, 3961, 4699, 5433, 6457, 7433, 8770, 10109, 11818, 13547, 15912, 18109, 21105, 24121, 27959, 31736, 36840, 41670

Offset: 0

Gus Wiseman, Apr 15 2019

nonn

For example, (32211) has two distinct multiplicities (1 and 2) so is counted under a(9).

The Heinz numbers of these partitions are given by A323055.

			The a(4) = 1 through a(9) = 19 partitions:
  (211)  (221)   (411)    (322)     (332)      (441)
         (311)   (3111)   (331)     (422)      (522)
         (2111)  (21111)  (511)     (611)      (711)
                          (2221)    (3221)     (3222)
                          (3211)    (4211)     (3321)
                          (4111)    (5111)     (4221)
                          (22111)   (22211)    (4311)
                          (31111)   (32111)    (5211)
                          (211111)  (41111)    (6111)
                                    (221111)   (22221)
                                    (311111)   (32211)
                                    (2111111)  (33111)
                                               (42111)
                                               (51111)
                                               (321111)
                                               (411111)
                                               (2211111)
                                               (3111111)
                                               (21111111)

Column k = 2 of A325242. Dominated by A325267.

Cf. A008284, A062770, A071625, A098859, A116608, A244515, A323055, A325244.

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

A325267 Number of integer partitions of n with omicron 2.

Original entry on oeis.org

0, 0, 1, 1, 3, 5, 7, 12, 17, 24, 33, 44, 57, 76, 100, 129, 168, 214, 282, 355, 462, 586, 755, 937, 1202, 1493, 1900, 2349, 2944, 3621, 4520, 5514, 6813, 8298, 10150, 12240, 14918, 17931, 21654, 25917, 31081, 37029, 44256, 52474, 62405, 73724, 87378, 102887

Offset: 0

Gus Wiseman, Apr 18 2019

nonn

The Heinz numbers of these partitions are given by A304634.

The omega-sequence of an integer partition is the sequence of lengths of the multisets obtained by repeatedly taking the multiset of multiplicities until a singleton is reached. We define the omicron of an integer partition to be 0 if the partition is empty, 1 if it is a singleton, and otherwise the second-to-last part of its omega-sequence. For example, the partition (32211) has chain of multisets of multiplicities {1,1,2,2,3} -> {1,2,2} -> {1,2} -> {1,1} -> {2}, so its omega-sequence is (5,3,2,2,1), and its omicron is 2.

			The a(1) = 1 through a(8) = 17 partitions:
  (11)  (21)  (22)   (32)    (33)     (43)      (44)
              (31)   (41)    (42)     (52)      (53)
              (211)  (221)   (51)     (61)      (62)
                     (311)   (411)    (322)     (71)
                     (2111)  (2211)   (331)     (332)
                             (3111)   (511)     (422)
                             (21111)  (2221)    (611)
                                      (3211)    (3221)
                                      (4111)    (3311)
                                      (22111)   (4211)
                                      (31111)   (5111)
                                      (211111)  (22211)
                                                (32111)
                                                (41111)
                                                (221111)
                                                (311111)
                                                (2111111)

Cf. A056239, A112798, A181819, A304634, A304636, A323014, A323023, A325250, A325273, A325277.
Omega-sequence statistics: A001222 (first omega), A001221 (second omega), A071625 (third omega), A323022 (fourth omega), A304465 (second-to-last omega), A182850 or A323014 (length/frequency depth), A325248 (Heinz number), A325249 (sum).
Integer partition triangles: A008284 (first omega), A116608 (second omega), A325242 (third omega), A325268 (second-to-last omega), A225485 or A325280 (length/frequency depth).

Table[Length[Select[IntegerPartitions[n],Switch[#,{},0,{},1,,NestWhile[Sort[Length/@Split[#]]&,#,Length[#]>1&]//First]==2&]],{n,0,30}]

A325285 Number of integer partitions of n whose omega-sequence has repeated parts.

Original entry on oeis.org

0, 0, 0, 1, 2, 5, 6, 13, 17, 26, 36, 54, 66, 98, 125, 164, 214, 285, 354, 468, 585, 745, 945, 1195, 1477, 1864, 2317, 2867, 3544, 4383, 5348, 6589, 8028, 9778, 11885, 14403, 17362, 20992, 25212, 30239, 36158, 43242, 51408, 61240, 72568, 85989, 101607, 120027

Offset: 0

Gus Wiseman, Apr 24 2019

nonn

The omega-sequence of an integer partition is the sequence of lengths of the multisets obtained by repeatedly taking the multiset of multiplicities until a singleton is reached. For example, the partition (32211) has chain of multisets of multiplicities {1,1,2,2,3} -> {1,2,2} -> {1,2} -> {1,1} -> {2}, so its omega-sequence is (5,3,2,2,1), which has repeated parts, so (32211) is counted under a(9).

The Heinz numbers of these partitions are given by A325411.

			The a(3) = 1 through a(8) = 17 partitions:
  (21)  (31)   (32)    (42)     (43)      (53)
        (211)  (41)    (51)     (52)      (62)
               (221)   (321)    (61)      (71)
               (311)   (411)    (322)     (332)
               (2111)  (3111)   (331)     (422)
                       (21111)  (421)     (431)
                                (511)     (521)
                                (2221)    (611)
                                (3211)    (3221)
                                (4111)    (4211)
                                (22111)   (5111)
                                (31111)   (22211)
                                (211111)  (32111)
                                          (41111)
                                          (221111)
                                          (311111)
                                          (2111111)

Cf. A047966, A181819, A323014, A323023, A325247, A325250, A325260, A325262, A325411.

Integer partition triangles: A008284 (first omega), A116608 (second omega), A325242 (third omega), A325268 (second-to-last omega), A225485 or A325280 (frequency depth), A325414 (omega-sequence sum).

omseq[ptn_List]:=If[ptn=={},{},Length/@NestWhileList[Sort[Length/@Split[#]]&,ptn,Length[#]>1&]];
Table[Length[Select[IntegerPartitions[n],!UnsameQ@@omseq[#]&]],{n,0,30}]

A325458 Triangle read by rows where T(n,k) is the number of integer partitions of n with largest hook of size k, i.e., with (largest part) + (number of parts) - 1 = k.

Original entry on oeis.org

1, 0, 1, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 1, 4, 0, 0, 0, 0, 2, 5, 0, 0, 0, 0, 2, 3, 6, 0, 0, 0, 0, 0, 4, 4, 7, 0, 0, 0, 0, 0, 3, 6, 5, 8, 0, 0, 0, 0, 0, 1, 6, 8, 6, 9, 0, 0, 0, 0, 0, 0, 6, 9, 10, 7, 10, 0, 0, 0, 0, 0, 0, 2, 11, 12, 12, 8, 11

Offset: 0

Gus Wiseman, May 04 2019

Conjectured to be equal to A049597.

			Triangle begins:
  1
  0  1
  0  0  2
  0  0  0  3
  0  0  0  1  4
  0  0  0  0  2  5
  0  0  0  0  2  3  6
  0  0  0  0  0  4  4  7
  0  0  0  0  0  3  6  5  8
  0  0  0  0  0  1  6  8  6  9
  0  0  0  0  0  0  6  9 10  7 10
  0  0  0  0  0  0  2 11 12 12  8 11
  0  0  0  0  0  0  2  9 16 15 14  9 12
  0  0  0  0  0  0  0  7 16 21 18 16 10 13
  0  0  0  0  0  0  0  4 18 23 26 21 18 11 14
  0  0  0  0  0  0  0  3 12 29 30 31 24 20 12 15
  0  0  0  0  0  0  0  1 12 27 40 37 36 27 22 13 16
  0  0  0  0  0  0  0  0  8 26 42 51 44 41 30 24 14 17
  0  0  0  0  0  0  0  0  6 23 48 57 62 51 46 33 26 15 18
  0  0  0  0  0  0  0  0  2 21 44 70 72 73 58 51 36 28 16 19
Row n = 9 counts the following partitions:
  (333)  (54)     (63)      (72)       (9)
         (432)    (522)     (621)      (81)
         (441)    (531)     (5211)     (711)
         (3222)   (4221)    (42111)    (6111)
         (3321)   (4311)    (321111)   (51111)
         (22221)  (32211)   (2211111)  (411111)
                  (33111)              (3111111)
                  (222111)             (21111111)
                                       (111111111)

Row sums are A000041.
Column sums are 2^(k - 1) for k > 0.
Cf. A008284, A049597, A093641, A116608, A325242, A325349, A325351, A325355, A325359, A325459.

Table[Length[Select[IntegerPartitions[n],If[n==0,k==0,First[#]+Length[#]-1==k]&]],{n,0,19},{k,0,n}]

Franklin T. Adams-Watters has conjectured at A049597 that the k-th column gives the coefficients of the sum of Gaussian polynomials [k,m] for m = 0..k.

A325279 Number of integer partitions of n whose maximum multiplicity is one greater than their minimum multiplicity.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 1, 5, 6, 9, 10, 18, 18, 31, 34, 48, 57, 80, 86, 122, 138, 183, 211, 275, 311, 402, 461, 576, 663, 825, 942, 1163, 1334, 1621, 1865, 2248, 2566, 3084, 3532, 4193, 4794, 5674, 6472, 7617, 8685, 10153, 11576, 13483, 15320, 17790, 20200, 23342

Offset: 0

Gus Wiseman, Apr 18 2019

nonn

The Heinz numbers of these partitions are given by A325241.

For example, the partition (44111) has two multiplicities (2 and 3) which differ by 1, so is counted under a(11).

			The a(4) = 1 through a(11) = 18 partitions:
  (211)  (221)  (411)  (322)    (332)    (441)    (433)      (443)
         (311)         (331)    (422)    (522)    (442)      (533)
                       (511)    (611)    (711)    (622)      (551)
                       (3211)   (3221)   (3321)   (811)      (722)
                       (22111)  (4211)   (4221)   (5221)     (911)
                                (22211)  (4311)   (5311)     (4322)
                                         (5211)   (6211)     (4331)
                                         (32211)  (33211)    (4421)
                                         (33111)  (42211)    (5411)
                                                  (2221111)  (6221)
                                                             (6311)
                                                             (7211)
                                                             (33221)
                                                             (33311)
                                                             (43211)
                                                             (44111)
                                                             (52211)
                                                             (2222111)

Cf. A047966, A062770, A071625, A098859, A117571, A127002, A325242, A325244, A325245, A325280.

Table[Length[Select[IntegerPartitions[n],Max@@Length/@Split[#]-Min@@Length/@Split[#]==1&]],{n,0,30}]

A353741 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with product k, all zeros removed.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 3, 1, 3, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 3, 1, 1, 3, 2, 2, 2, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 3, 1, 1, 4, 2, 2, 1, 4, 1, 1, 1, 3, 2

Offset: 0

Gus Wiseman, May 20 2022

Warning: There are certain internal "holes" in A339095 that are removed in this sequence.

			Triangle begins:
  1
  1
  1 1
  1 1 1
  1 1 1 2
  1 1 1 2 1 1
  1 1 1 2 1 2 2 1
  1 1 1 2 1 2 1 2 1 1 2
  1 1 1 2 1 2 1 3 1 1 3 1 3 1
  1 1 1 2 1 2 1 3 2 1 3 1 1 3 2 2 2 1
  1 1 1 2 1 2 1 3 2 2 3 1 1 4 2 2 1 4 1 1 1 3 2
Row n = 7 counts the following partitions:
  1111111   211111   31111   4111    511   61     7   421    331   52   43
                             22111         3211       2221              322

Row sums are A000041.
Row lengths are A034891.
A partial transpose is A319000.
The full version with zeros is A339095, rank statistic A003963.
A008284 counts partitions by sum, strict A116608.
A225485 counts partitions by frequency depth.
A266477 counts partitions by product of multiplicities, ranked by A005361.
Cf. A002033, A266499, A325242, A325268, A325280, A353503, A353506, A353698.

DeleteCases[Table[Length[Select[IntegerPartitions[n],Times@@#==k&]],{n,0,10},{k,1,2^n}],0,2]

cp's OEIS Frontend

A325415 Number of distinct sums of omega-sequences of integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325412 Number of distinct omega-sequences of integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A353843 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with partition run-sum trajectory ending in a partition of length k. All zeros removed.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325243 Number of integer partitions of n with exactly two distinct multiplicities.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325267 Number of integer partitions of n with omicron 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325285 Number of integer partitions of n whose omega-sequence has repeated parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325458 Triangle read by rows where T(n,k) is the number of integer partitions of n with largest hook of size k, i.e., with (largest part) + (number of parts) - 1 = k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A325279 Number of integer partitions of n whose maximum multiplicity is one greater than their minimum multiplicity.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A353741 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with product k, all zeros removed.

Views

Author

Keywords

Comments

Examples