A100883 -id:A100883 - cp's OEIS frontend

A332835 Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing.

1, 1, 2, 4, 8, 16, 29, 56, 101, 181, 327, 583, 1023, 1820, 3207, 5631, 9905, 17394, 30489, 53481, 93725, 164169, 287606, 503672, 881834, 1544018, 2703161, 4731860, 8283291, 14499392, 25379278, 44422866, 77754798, 136093756, 238204369, 416923752, 729728031

Offset: 0

Gus Wiseman, Feb 29 2020

nonn

A composition of n is a finite sequence of positive integers summing to n.

			The a(6) = 29 compositions:
  (6)    (141)  (213)   (1113)  (21111)
  (51)   (114)  (132)   (222)   (12111)
  (15)   (33)   (123)   (2211)  (11121)
  (42)   (321)  (3111)  (2121)  (11112)
  (24)   (312)  (1311)  (1212)  (111111)
  (411)  (231)  (1131)  (1122)
Missing are: (2112), (1221), (11211).

Andrew Howroyd, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Unimodal Sequence

The version for the compositions themselves (not run-lengths) is A329398.
Compositions with equal run-lengths are A329738.
The case of partitions is A332745.
The version for unsorted prime signature is the complement of A332831.
The complement is counted by A332833.
Unimodal compositions are A001523.
Partitions with weakly decreasing run-lengths are A100882.
Partitions with weakly increasing run-lengths are A100883.
Compositions that are not unimodal are A115981.
Compositions whose negation is unimodal are A332578.
Compositions whose run-lengths are unimodal are A332726.
Neither weakly increasing nor weakly decreasing compositions are A332834.
Compositions with weakly increasing run-lengths are A332836.
Compositions that are neither unimodal nor is their negation are A332870.
Cf. A001462, A181819, A329744, A329766, A332273, A332640, A332641, A332746.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],Or[LessEqual@@Length/@Split[#],GreaterEqual@@Length/@Split[#]]&]],{n,0,20}]

a(n) = 2 * A332836(n) - A329738(n).

Terms a(21) and beyond from Andrew Howroyd, Dec 30 2020

A332577 Number of integer partitions of n covering an initial interval of positive integers with unimodal run-lengths.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 11, 14, 16, 19, 23, 25, 30, 36, 40, 45, 54, 59, 68, 79, 86, 96, 112, 121, 135, 155, 168, 188, 214, 230, 253, 284, 308, 337, 380, 407, 445, 497, 533, 580, 645, 689, 748, 828, 885, 956, 1053, 1124, 1212, 1330, 1415, 1519, 1665, 1771

Offset: 0

Gus Wiseman, Feb 24 2020

nonn

A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

			The a(1) = 1 through a(9) = 8 partitions:
  1  11  21   211   221    321     2221     3221      3321
         111  1111  2111   2211    3211     22211     22221
                    11111  21111   22111    32111     32211
                           111111  211111   221111    222111
                                   1111111  2111111   321111
                                            11111111  2211111
                                                      21111111
                                                      111111111

MathWorld, Unimodal Sequence

Not requiring unimodality gives A000009.
A version for compositions is A227038.
Not requiring the partition to cover an initial interval gives A332280.
The complement is counted by A332579.
Unimodal compositions are A001523.
Cf. A007052, A011782, A025065, A100883, A107429, A115981, A332281, A332283, A332638, A332639, A332728.

normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]]
Table[Length[Select[IntegerPartitions[n],normQ[#]&&unimodQ[Length/@Split[#]]&]],{n,0,30}]

A332745 Number of integer partitions of n whose run-lengths are either weakly increasing or weakly decreasing.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 21, 29, 39, 51, 68, 87, 113, 143, 183, 228, 289, 354, 443, 544, 672, 812, 1001, 1202, 1466, 1758, 2123, 2525, 3046, 3606, 4308, 5089, 6054, 7102, 8430, 9855, 11621, 13571, 15915, 18500, 21673, 25103, 29245, 33835, 39296, 45277, 52470

Offset: 0

Gus Wiseman, Feb 29 2020

nonn

Also partitions whose run-lengths and negated run-lengths are both unimodal.

			The a(8) = 21 partitions are:
  (8)     (44)     (2222)
  (53)    (332)    (22211)
  (62)    (422)    (32111)
  (71)    (431)    (221111)
  (521)   (3311)   (311111)
  (611)   (4211)   (2111111)
  (5111)  (41111)  (11111111)
Missing from this list is only (3221).

The complement is counted by A332641.
The Heinz numbers of partitions not in this class are A332831.
The case of run-lengths of compositions is A332835.
Only weakly decreasing is A100882.
Only weakly increasing is A100883.
Unimodal compositions are A001523.
Non-unimodal compositions are A115981.
Partitions with unimodal run-lengths are A332280.
Partitions whose negated run-lengths are unimodal are A332638.
Compositions with unimodal run-lengths are A332726.
Compositions that are neither weakly increasing nor decreasing are A332834.
Cf. A025065, A059204, A181819, A328509, A332281, A332283, A332577, A332578, A332640, A332727, A332742, A332833.

Table[Length[Select[IntegerPartitions[n],Or[LessEqual@@Length/@Split[#],GreaterEqual@@Length/@Split[#]]&]],{n,0,30}]

A304405 Number of partitions of n in which the sequence of the sum of the same summands is nondecreasing.

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 10, 12, 18, 22, 31, 37, 52, 61, 80, 97, 127, 147, 189, 220, 277, 325, 402, 469, 578, 665, 804, 933, 1121, 1282, 1537, 1754, 2081, 2374, 2793, 3179, 3739, 4232, 4923, 5587, 6477, 7305, 8445, 9519, 10949, 12323, 14110, 15825, 18099, 20229, 23005

Offset: 0

Seiichi Manyama, May 12 2018

nonn

Number of integer partitions of n with weakly decreasing run-sums, complement A357878. - Gus Wiseman, Oct 22 2022

			n |                      | Sequence of the sum of the same summands
--+----------------------+-----------------------------------------
1 | 1                    | 1
2 | 2                    | 2
  | 1+1                  | 2
3 | 3                    | 3
  | 2+1                  | 1, 2
  | 1+1+1                | 3
4 | 4                    | 4
  | 3+1                  | 1, 3
  | 2+2                  | 4
  | 2+1+1                | 2, 2
  | 1+1+1+1              | 4
5 | 5                    | 5
  | 4+1                  | 1, 4
  | 3+2                  | 2, 3
  | 3+1+1                | 2, 3
  | 2+2+1                | 1, 4
  | 1+1+1+1+1            | 5
6 | 6                    | 6
  | 5+1                  | 1, 5
  | 4+2                  | 2, 4
  | 4+1+1                | 2, 4
  | 3+3                  | 6
  | 3+2+1                | 1, 2, 3
  | 3+1+1+1              | 3, 3
  | 2+2+2                | 6
  | 2+2+1+1              | 2, 4
  | 1+1+1+1+1+1          | 6

The strict opposite version is A304430, ranked by A357864.
The strict version is A304428, ranked by A357862.
The opposite version is A304406, ranked by A357861.
Number of rows in A354584 summing to n that are strictly increasing.
These partitions are ranked by A357875.
A000041 counts integer partitions, strict A000009.
A304442 counts partitions with equal run-sums, distinct A353837.
Cf. A047966, A087980, A098859, A100883, A239312, A275870, A353832, A353864.

Table[Length[Select[IntegerPartitions[n],GreaterEqual@@Total/@Split[#]&]],{n,0,30}] (* Gus Wiseman, Oct 22 2022 *)

A332726 Number of compositions of n whose run-lengths are unimodal.

Original entry on oeis.org

1, 1, 2, 4, 8, 16, 31, 61, 120, 228, 438, 836, 1580, 2976, 5596, 10440, 19444, 36099, 66784, 123215, 226846, 416502, 763255, 1395952, 2548444, 4644578, 8452200, 15358445, 27871024, 50514295, 91446810, 165365589, 298730375, 539127705, 972099072, 1751284617, 3152475368

Offset: 0

Gus Wiseman, Feb 29 2020

nonn

A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

A composition of n is a finite sequence of positive integers summing to n.

			The only composition of 6 whose run-lengths are not unimodal is (1,1,2,1,1).

Andrew Howroyd, Table of n, a(n) for n = 0..500
Eric Weisstein's World of Mathematics, Unimodal Sequence.

Looking at the composition itself (not run-lengths) gives A001523.
The case of partitions is A332280, with complement counted by A332281.
The complement is counted by A332727.
Unimodal compositions are A001523.
Unimodal normal sequences appear to be A007052.
Non-unimodal compositions are A115981.
Compositions with normal run-lengths are A329766.
Numbers whose prime signature is not unimodal are A332282.
Partitions whose 0-appended first differences are unimodal are A332283, with complement A332284, with Heinz numbers A332287.
Compositions whose negated run-lengths are unimodal are A332578.
Compositions whose negated run-lengths are not unimodal are A332669.
Compositions whose run-lengths are weakly increasing are A332836.
Cf. A072706, A100883, A181819, A227038, A328509, A329744, A329746, A332642, A332670, A332741, A332833, A332835.

unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]]
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],unimodQ[Length/@Split[#]]&]],{n,0,10}]

step(M, m)={my(n=matsize(M)[1]); for(p=m+1, n, my(v=vector((p-1)\m, i, M[p-i*m,i]), s=vecsum(v)); M[p,]+=vector(#M,i,s-if(i<=#v, v[i]))); M}
desc(M, m)={my(n=matsize(M)[1]); while(m>1, m--; M=step(M,m)); vector(n, i, vecsum(M[i,]))/(#M-1)}
seq(n)={my(M=matrix(n+1, n+1, i, j, i==1), S=M[,1]~); for(m=1, n, my(D=M); M=step(M, m); D=(M-D)[m+1..n+1,1..n-m+2]; S+=concat(vector(m), desc(D,m))); S} \\ Andrew Howroyd, Dec 31 2020

a(n) + A332727(n) = 2^(n - 1).

Terms a(21) and beyond from Andrew Howroyd, Dec 31 2020

A317256 Number of alternately co-strong integer partitions of n.

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 11, 13, 19, 25, 35, 42, 61, 74, 98, 122, 161, 194, 254, 304, 388, 472, 589, 700, 878, 1044, 1278, 1525, 1851, 2182, 2651, 3113, 3735, 4389, 5231, 6106, 7278, 8464, 9995, 11631, 13680, 15831, 18602, 21463, 25068, 28927, 33654, 38671, 44942, 51514

Offset: 0

Gus Wiseman, Jul 25 2018

nonn

A sequence is alternately co-strong if either it is empty, equal to (1), or its run-lengths are weakly increasing (co-strong) and, when reversed, are themselves an alternately co-strong sequence.

Also the number of alternately strong reversed integer partitions of n.

			The a(1) = 1 through a(7) = 13 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (21)   (22)    (32)     (33)      (43)
             (111)  (31)    (41)     (42)      (52)
                    (211)   (311)    (51)      (61)
                    (1111)  (2111)   (222)     (322)
                            (11111)  (321)     (421)
                                     (411)     (511)
                                     (2211)    (3211)
                                     (3111)    (4111)
                                     (21111)   (22111)
                                     (111111)  (31111)
                                               (211111)
                                               (1111111)
For example, starting with the partition y = (3,2,2,1,1) and repeatedly taking run-lengths and reversing gives (3,2,2,1,1) -> (2,2,1) -> (1,2), which is not weakly decreasing, so y is not  alternately co-strong. On the other hand, we have (3,3,2,2,1,1,1) -> (3,2,2) -> (2,1) -> (1,1) -> (2) -> (1), so (3,3,2,2,1,1,1) is counted under a(13).

Cf. A000041, A100883, A181819, A182850, A182857, A304660, A305563, A317081, A317086, A317245, A317258.
The Heinz numbers of these partitions are given by A317257.
The total (instead of alternating) version is A332275.
Dominates A332289 (the normal version).
The generalization to compositions is A332338.
The dual version is A332339.
The case of reversed partitions is (also) A332339.
Cf. A316496  A317491, A329746, A332292, A332297, A332340.

tniQ[q_]:=Or[q=={},q=={1},And[LessEqual@@Length/@Split[q],tniQ[Reverse[Length/@Split[q]]]]];
Table[Length[Select[IntegerPartitions[n],tniQ]],{n,0,30}]

Updated with corrected terminology by Gus Wiseman, Mar 08 2020

A332640 Number of integer partitions of n such that neither the run-lengths nor the negated run-lengths are unimodal.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 4, 6, 12, 17, 29, 44, 66, 92, 138, 187, 266, 359, 492, 649, 877, 1140, 1503, 1938, 2517, 3202, 4111, 5175, 6563, 8209, 10297, 12763, 15898, 19568, 24152, 29575, 36249, 44090, 53737, 65022, 78752, 94873, 114294

Offset: 0

Gus Wiseman, Feb 25 2020

nonn

A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

			The a(14) = 1 through a(18) = 12 partitions:
  (433211)  (533211)   (443221)    (544211)     (544311)
            (4332111)  (633211)    (733211)     (553221)
                       (5332111)   (4333211)    (644211)
                       (43321111)  (6332111)    (833211)
                                   (53321111)   (4432221)
                                   (433211111)  (5333211)
                                                (5442111)
                                                (7332111)
                                                (43332111)
                                                (63321111)
                                                (533211111)
                                                (4332111111)
For example, the partition (4,3,3,2,1,1) has run-lengths (1,2,1,2), so is counted under a(14).

MathWorld, Unimodal Sequence

Looking only at the original run-lengths gives A332281.
Looking only at the negated run-lengths gives A332639.
The Heinz numbers of these partitions are A332643.
The complement is counted by A332746.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Partitions with unimodal run-lengths are A332280.
Partitions whose negated run-lengths are unimodal are A332638.
Run-lengths and negated run-lengths are not both unimodal: A332641.
Compositions whose negation is not unimodal are A332669.
Run-lengths and negated run-lengths are both unimodal: A332745.
Cf. A007052, A025065, A100883, A181819, A328509, A332282, A332284, A332577, A332578, A332579, A332642, A332726, A332727.

unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]]
Table[Length[Select[IntegerPartitions[n],!unimodQ[Length/@Split[#]]&&!unimodQ[-Length/@Split[#]]&]],{n,0,30}]

A332831 Numbers whose unsorted prime signature is neither weakly increasing nor weakly decreasing.

Original entry on oeis.org

90, 126, 198, 234, 270, 300, 306, 342, 350, 378, 414, 522, 525, 540, 550, 558, 588, 594, 600, 630, 650, 666, 702, 738, 756, 774, 810, 825, 846, 850, 918, 950, 954, 975, 980, 990, 1026, 1050, 1062, 1078, 1098, 1134, 1150, 1170, 1176, 1188, 1200, 1206, 1242

Offset: 1

Gus Wiseman, Mar 02 2020

nonn

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

			The sequence of terms together with their prime indices begins:
   90: {1,2,2,3}
  126: {1,2,2,4}
  198: {1,2,2,5}
  234: {1,2,2,6}
  270: {1,2,2,2,3}
  300: {1,1,2,3,3}
  306: {1,2,2,7}
  342: {1,2,2,8}
  350: {1,3,3,4}
  378: {1,2,2,2,4}
  414: {1,2,2,9}
  522: {1,2,2,10}
  525: {2,3,3,4}
  540: {1,1,2,2,2,3}
  550: {1,3,3,5}
  558: {1,2,2,11}
  588: {1,1,2,4,4}
  594: {1,2,2,2,5}
  600: {1,1,1,2,3,3}
  630: {1,2,2,3,4}
For example, the prime signature of 540 is (2,3,1), so 540 is in the sequence.

The version for run-lengths of partitions is A332641.
The version for run-lengths of compositions is A332833.
The version for compositions is A332834.
Prime signature is A124010.
Unimodal compositions are A001523.
Partitions with weakly increasing run-lengths are A100883.
Partitions with weakly increasing or decreasing run-lengths are A332745.
Compositions with weakly increasing or decreasing run-lengths are A332835.
Compositions with weakly increasing run-lengths are A332836.
Cf. A100882, A115981, A328509, A329398, A332281, A332640, A332643, A332746, A332836, A332870.

Select[Range[1000],!Or[LessEqual@@Last/@FactorInteger[#],GreaterEqual@@Last/@FactorInteger[#]]&]

Intersection of A071365 and A112769.

A332292 Number of widely alternately strongly normal integer partitions of n.

Original entry on oeis.org

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

Offset: 0

Gus Wiseman, Feb 16 2020

An integer partition is widely alternately strongly normal if either it is constant 1's (wide) or it covers an initial interval of positive integers (normal) and has weakly decreasing run-lengths (strong) which, if reversed, are themselves a widely alternately strongly normal partition.

Also the number of widely alternately co-strongly normal reversed integer partitions of n.

			The a(1) = 1, a(3) = 2, and a(21) = 3 partitions:
  (1)  (21)   (654321)
       (111)  (4443321)
              (111111111111111111111)
For example, starting with the partition y = (4,4,4,3,3,2,1) and repeatedly taking run-lengths and reversing gives (4,4,4,3,3,2,1) -> (1,1,2,3) -> (1,1,2) -> (1,2) -> (1,1). All of these are normal with weakly decreasing run-lengths, and the last is all 1's, so y is counted under a(21).

Normal partitions are A000009.
The non-strong version is A332277.
The co-strong version is A332289.
The case of reversed partitions is (also) A332289.
The case of compositions is A332340.
Cf. A100883, A181819, A317081, A317245, A317256, A317491, A329746, A329747, A332278, A332290, A332291, A332297, A332337.

totnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[ptn]==Range[Max[ptn]],GreaterEqual@@Length/@Split[ptn],totnQ[Reverse[Length/@Split[ptn]]]]];
Table[Length[Select[IntegerPartitions[n],totnQ]],{n,0,30}]

a(71)-a(77) from Jinyuan Wang, Jun 26 2020

A332641 Number of integer partitions of n whose run-lengths are neither weakly increasing nor weakly decreasing.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 9, 14, 22, 33, 48, 69, 96, 136, 184, 248, 330, 443, 574, 756, 970, 1252, 1595, 2040, 2558, 3236, 4041, 5054, 6256, 7781, 9547, 11782, 14394, 17614, 21423, 26083, 31501, 38158, 45930, 55299, 66262, 79477, 94803, 113214

Offset: 0

Gus Wiseman, Feb 26 2020

nonn

Also partitions whose run-lengths and negated run-lengths are not both unimodal. A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

			The a(8) = 1 through a(13) = 14 partitions:
  (3221)  (4221)  (5221)   (4331)    (4332)     (5332)
                  (32221)  (6221)    (5331)     (6331)
                  (33211)  (42221)   (7221)     (8221)
                           (322211)  (43221)    (43321)
                           (332111)  (44211)    (44311)
                                     (52221)    (53221)
                                     (322221)   (62221)
                                     (422211)   (332221)
                                     (3321111)  (333211)
                                                (422221)
                                                (442111)
                                                (522211)
                                                (3222211)
                                                (33211111)

MathWorld, Unimodal Sequence

The complement is counted by A332745.
The Heinz numbers of these partitions are A332831.
The case of run-lengths of compositions is A332833.
Partitions whose run-lengths are weakly increasing are A100883.
Partitions whose run-lengths are weakly decreasing are A100882.
Partitions whose run-lengths are not unimodal are A332281.
Partitions whose negated run-lengths are not unimodal are A332639.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Partitions with unimodal run-lengths are A332280.
Partitions whose negated run-lengths are unimodal are A332638.
Compositions whose negation is not unimodal are A332669.
The case of run-lengths of compositions is A332833.
Compositions that are neither increasing nor decreasing are A332834.
Cf. A025065, A181819, A328509, A332282, A332284, A332577, A332578, A332579, A332640, A332642, A332726, A332727, A332742, A332835.

Table[Length[Select[IntegerPartitions[n],!Or[LessEqual@@Length/@Split[#],GreaterEqual@@Length/@Split[#]]&]],{n,0,30}]

cp's OEIS Frontend

A332835 Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A332577 Number of integer partitions of n covering an initial interval of positive integers with unimodal run-lengths.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A332745 Number of integer partitions of n whose run-lengths are either weakly increasing or weakly decreasing.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A304405 Number of partitions of n in which the sequence of the sum of the same summands is nondecreasing.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A332726 Number of compositions of n whose run-lengths are unimodal.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A317256 Number of alternately co-strong integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A332640 Number of integer partitions of n such that neither the run-lengths nor the negated run-lengths are unimodal.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A332831 Numbers whose unsorted prime signature is neither weakly increasing nor weakly decreasing.

Views

Author

Keywords

Comments

Examples