A329766 -id:A329766 - cp's OEIS frontend

A333191 Number of compositions of n whose run-lengths are either strictly increasing or strictly decreasing.

1, 1, 2, 2, 5, 8, 10, 18, 24, 29, 44, 60, 68, 100, 130, 148, 201, 256, 310, 396, 478, 582, 736, 898, 1068, 1301, 1594, 1902, 2288, 2750, 3262, 3910, 4638, 5510, 6538, 7686, 9069, 10670, 12560, 14728, 17170, 20090, 23462, 27292, 31710, 36878, 42704, 49430

Offset: 0

Gus Wiseman, May 17 2020

nonn

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

			The a(1) = 1 through a(7) = 18 compositions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (111)  (22)    (113)    (33)      (115)
                    (112)   (122)    (114)     (133)
                    (211)   (221)    (222)     (223)
                    (1111)  (311)    (411)     (322)
                            (1112)   (1113)    (331)
                            (2111)   (3111)    (511)
                            (11111)  (11112)   (1114)
                                     (21111)   (1222)
                                     (111111)  (2221)
                                               (4111)
                                               (11113)
                                               (11122)
                                               (22111)
                                               (31111)
                                               (111112)
                                               (211111)
                                               (1111111)

Giovanni Resta, Table of n, a(n) for n = 0..1000

The non-strict version is A332835.
The case of partitions is A333190.
Unimodal compositions are A001523.
Strict compositions are A032020.
Partitions with distinct run-lengths are A098859.
Partitions with strictly increasing run-lengths are A100471.
Partitions with strictly decreasing run-lengths are A100881.
Partitions with weakly decreasing run-lengths are A100882.
Partitions with weakly increasing run-lengths are A100883.
Compositions with equal run-lengths are A329738.
Compositions whose run-lengths are unimodal are A332726.
Compositions whose run-lengths are unimodal or co-unimodal are A332746.
Compositions whose run-lengths are neither incr. nor decr. are A332833.
Compositions that are neither increasing nor decreasing are A332834.
Compositions with weakly increasing run-lengths are A332836.
Compositions that are strictly incr. or strictly decr. are A333147.
Compositions with strictly increasing run-lengths are A333192.
Cf. A059204, A072706, A329398, A329744, A329766, A332641, A332726, A332831, A332745, A333149.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],Or[Less@@Length/@Split[#],Greater@@Length/@Split[#]]&]],{n,0,15}]

a(n > 0) = 2*A333192(n) - A000005(n).

Terms a(26) and beyond from Giovanni Resta, May 19 2020

A329741 Number of compositions of n whose multiplicities cover an initial interval of positive integers.

Original entry on oeis.org

1, 1, 1, 3, 6, 11, 14, 34, 52, 114, 225, 464, 539, 1183, 1963, 3753, 6120, 11207, 19808, 38254, 77194, 147906, 224853, 374216, 611081, 1099933, 2129347, 3336099, 5816094, 9797957, 17577710, 29766586, 53276392, 93139668, 163600815, 324464546, 637029845, 1010826499

Offset: 0

Gus Wiseman, Nov 20 2019

nonn

A composition of n is a finite sequence of positive integers with sum n.

			The a(1) = 1 through a(6) = 14 compositions:
  (1)  (2)  (3)    (4)      (5)      (6)
            (1,2)  (1,3)    (1,4)    (1,5)
            (2,1)  (3,1)    (2,3)    (2,4)
                   (1,1,2)  (3,2)    (4,2)
                   (1,2,1)  (4,1)    (5,1)
                   (2,1,1)  (1,1,3)  (1,1,4)
                            (1,2,2)  (1,2,3)
                            (1,3,1)  (1,3,2)
                            (2,1,2)  (1,4,1)
                            (2,2,1)  (2,1,3)
                            (3,1,1)  (2,3,1)
                                     (3,1,2)
                                     (3,2,1)
                                     (4,1,1)

Looking at run-lengths instead of multiplicities gives A329766.
The complete case is A329748.
Complete compositions are A107429.
Cf. A000740, A008965, A098504, A242882, A244164, A329738, A329739, A329740.

normQ[m_]:=Or[m=={},Union[m]==Range[Max[m]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],normQ[Length/@Split[Sort[#]]]&]],{n,20}]

a(0), a(21)-a(37) from Alois P. Heinz, Nov 21 2019

A332272 Number of narrowly recursively normal integer partitions of n.

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 8, 10, 14, 18, 23, 30, 37, 46, 52, 70, 80, 100, 116, 146, 171, 203, 236, 290, 332, 401, 458, 547, 626, 744, 851, 1004, 1157, 1353, 1553, 1821, 2110, 2434, 2810, 3250, 3741, 4304, 4949, 5661, 6510, 7450, 8501, 9657, 11078, 12506, 14329, 16185

Offset: 0

Gus Wiseman, Mar 08 2020

nonn

A sequence is narrowly recursively normal if either it is constant (narrow) or its run-lengths are a narrowly recursively normal sequence covering an initial interval of positive integers (normal).

			The a(6) = 8 partitions are (6), (51), (42), (411), (33), (321), (222), (111111). Missing from this list are (3111), (2211), (21111).
The a(1) = 1 through a(8) = 14 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (211)   (221)    (51)      (61)       (62)
                    (1111)  (311)    (222)     (322)      (71)
                            (11111)  (321)     (331)      (332)
                                     (411)     (421)      (422)
                                     (111111)  (511)      (431)
                                               (3211)     (521)
                                               (1111111)  (611)
                                                          (2222)
                                                          (3221)
                                                          (4211)
                                                          (11111111)

The strict instead of narrow version is A330937.
The normal case is A332277.
The widely normal case is A332277(n) - 1 for n > 1.
The wide version is A332295(n) - 1.
Cf. A000009, A107429, A181819, A316496, A317081, A317245, A317491, A329744, A329746, A329766, A332576.

normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
recnQ[ptn_]:=With[{qtn=Length/@Split[ptn]},Or[Length[qtn]<=1,And[normQ[qtn],recnQ[qtn]]]];
Table[Length[Select[IntegerPartitions[n],recnQ]],{n,0,30}]

For n > 1, a(n) = A317491(n) + A000005(n) - 2.

A329748 Number of complete compositions of n whose multiplicities cover an initial interval of positive integers.

Original entry on oeis.org

1, 1, 0, 2, 3, 3, 6, 12, 12, 42, 114, 210, 60, 360, 720, 1320, 1590, 3690, 6450, 16110, 33120, 59940, 61320, 112980, 171780, 387240, 803880, 769440, 1773240, 2823240, 5790960, 9916200, 19502280, 28244160, 56881440, 130548600, 279578880, 320554080, 541323720

Offset: 0

Gus Wiseman, Nov 21 2019

nonn

A composition of n is a finite sequence of positive integers with sum n. It is complete if it covers an initial interval of positive integers.

			The a(1) = 1 through a(8) = 12 compositions (empty column not shown):
  (1)  (12)  (112)  (122)  (123)  (1123)  (1223)
       (21)  (121)  (212)  (132)  (1132)  (1232)
             (211)  (221)  (213)  (1213)  (1322)
                           (231)  (1231)  (2123)
                           (312)  (1312)  (2132)
                           (321)  (1321)  (2213)
                                  (2113)  (2231)
                                  (2131)  (2312)
                                  (2311)  (2321)
                                  (3112)  (3122)
                                  (3121)  (3212)
                                  (3211)  (3221)

Looking at run-lengths instead of multiplicities gives A329749.
The non-complete version is A329741.
Complete compositions are A107429.
Cf. A008965, A098504, A244164, A274174, A329740, A329744, A329766.

normQ[m_]:=Or[m=={},Union[m]==Range[Max[m]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],normQ[#]&&normQ[Length/@Split[Sort[#]]]&]],{n,0,10}]

a(21)-a(38) from Alois P. Heinz, Jul 06 2020

A333192 Number of compositions of n with strictly increasing run-lengths.

Original entry on oeis.org

1, 1, 2, 2, 4, 5, 7, 10, 14, 16, 24, 31, 37, 51, 67, 76, 103, 129, 158, 199, 242, 293, 370, 450, 538, 652, 799, 953, 1147, 1376, 1635, 1956, 2322, 2757, 3271, 3845, 4539, 5336, 6282, 7366, 8589, 10046, 11735, 13647, 15858, 18442, 21354, 24716, 28630, 32985

Offset: 0

Gus Wiseman, May 17 2020

nonn

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

			The a(1) = 1 through a(8) = 14 compositions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (122)    (33)      (133)      (44)
                    (211)   (311)    (222)     (322)      (233)
                    (1111)  (2111)   (411)     (511)      (422)
                            (11111)  (3111)    (1222)     (611)
                                     (21111)   (4111)     (2222)
                                     (111111)  (22111)    (5111)
                                               (31111)    (11222)
                                               (211111)   (41111)
                                               (1111111)  (122111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)
For example, the composition (1,2,2,1,1,1) has run-lengths (1,2,3), so is counted under a(8).

Giovanni Resta, Table of n, a(n) for n = 0..1000

The case of partitions is A100471.
The non-strict version is A332836.
Strictly increasing compositions are A000009.
Unimodal compositions are A001523.
Strict compositions are A032020.
Partitions with strictly increasing run-lengths are A100471.
Partitions with strictly decreasing run-lengths are A100881.
Compositions with equal run-lengths are A329738.
Compositions whose run-lengths are unimodal are A332726.
Compositions with strictly increasing or decreasing run-lengths are A333191.
Numbers with strictly increasing prime multiplicities are A334965.
Cf. A072706, A098859, A100882, A100883, A304686, A329744, A329766, A332726, A332833, A332834, A332835, A333147, A333149, A333190.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],Less@@Length/@Split[#]&]],{n,0,15}]
b[n_, lst_, v_] := b[n, lst, v] = If[n == 0, 1, If[n <= lst, 0, Sum[If[k == v, 0, b[n - k pz, pz, k]], {pz, lst + 1, n}, {k, Floor[n/pz]}]]]; a[n_] := b[n, 0, 0]; a /@ Range[0, 50] (* Giovanni Resta, May 18 2020 *)

Terms a(26) and beyond from Giovanni Resta, May 18 2020

A329749 Number of complete compositions of n whose run-lengths cover an initial interval of positive integers.

Original entry on oeis.org

1, 1, 0, 2, 3, 5, 11, 23, 40, 80, 180, 344, 661, 1321, 2657, 5268, 10481, 20903, 41572, 82734, 164998, 328304, 654510, 1305421, 2598811, 5182174, 10332978, 20594318, 41066611, 81897091, 163309679, 325707492, 649648912, 1295827380, 2584941276, 5156774487

Offset: 0

Gus Wiseman, Nov 21 2019

nonn

A composition of n is a finite sequence of positive integers with sum n. It is complete if it covers an initial interval of positive integers.

			The a(0) = 1 through a(6) = 11 compositions (empty column not shown):
  ()  (1)  (1,2)  (1,1,2)  (1,2,2)    (1,2,3)
           (2,1)  (1,2,1)  (2,1,2)    (1,3,2)
                  (2,1,1)  (2,2,1)    (2,1,3)
                           (1,1,2,1)  (2,3,1)
                           (1,2,1,1)  (3,1,2)
                                      (3,2,1)
                                      (1,2,1,2)
                                      (1,2,2,1)
                                      (2,1,1,2)
                                      (2,1,2,1)
                                      (1,1,2,1,1)

Looking at  multiplicities instead of run-lengths gives A329748.
The non-complete version is A329766.
Complete compositions are A107429.
Cf. A000740, A008965, A098504, A244164, A274174, A329738, A329739, A329740, A329741, A329744.

normQ[m_]:=Or[m=={},Union[m]==Range[Max[m]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],normQ[#]&&normQ[Length/@Split[#]]&]],{n,0,10}]

a(21)-a(35) from Alois P. Heinz, Jul 06 2020

A332871 Number of compositions of n whose run-lengths are not weakly increasing.

Original entry on oeis.org

0, 0, 0, 0, 1, 4, 8, 24, 55, 128, 282, 625, 1336, 2855, 6000, 12551, 26022, 53744, 110361, 225914, 460756, 937413, 1902370, 3853445, 7791647, 15732468, 31725191, 63907437, 128613224, 258626480, 519700800, 1043690354, 2094882574, 4202903667, 8428794336, 16897836060

Offset: 0

Gus Wiseman, Feb 29 2020

nonn

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

Also compositions whose run-lengths are not weakly decreasing.

			The a(4) = 1 through a(6) = 8 compositions:
  (112)  (113)   (114)
         (221)   (1113)
         (1112)  (1131)
         (1121)  (1221)
                 (2112)
                 (11112)
                 (11121)
                 (11211)
For example, the composition (2,1,1,2) has run-lengths (1,2,1), which are not weakly increasing, so (2,1,1,2) is counted under a(6).

Andrew Howroyd, Table of n, a(n) for n = 0..1000

The version for the compositions themselves (not run-lengths) is A056823.
The version for unsorted prime signature is A112769, with dual A071365.
The case without weakly decreasing run-lengths either is A332833.
The complement is counted by A332836.
Compositions that are not unimodal are A115981.
Compositions with equal run-lengths are A329738.
Compositions whose run-lengths are not unimodal are A332727.
Cf. A001523, A072704, A100883, A181819, A329744, A329766, A332641, A332669, A332726, A332745, A332746, A332834, A332835.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],!LessEqual@@Length/@Split[#]&]],{n,0,10}]

a(n) = 2^(n - 1) - A332836(n).

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

A330937 Number of strictly recursively normal integer partitions of n.

Original entry on oeis.org

1, 2, 3, 5, 7, 10, 15, 20, 27, 35, 49, 58, 81, 100, 126, 160, 206, 246, 316, 374, 462, 564, 696, 813, 1006, 1195, 1441, 1701, 2058, 2394, 2896, 3367, 4007, 4670, 5542, 6368, 7540, 8702, 10199, 11734, 13760, 15734, 18384, 21008, 24441, 27893, 32380, 36841

Offset: 0

Gus Wiseman, Mar 09 2020

nonn

A sequence is strictly recursively normal if either it empty, its run-lengths are distinct (strict), or its run-lengths cover an initial interval of positive integers (normal) and are themselves a strictly recursively normal sequence.

			The a(1) = 1 through a(9) = 15 partitions:
  (1)  (2)  (3)   (4)    (5)    (6)    (7)     (8)     (9)
            (21)  (31)   (32)   (42)   (43)    (53)    (54)
                  (211)  (41)   (51)   (52)    (62)    (63)
                         (221)  (321)  (61)    (71)    (72)
                         (311)  (411)  (322)   (332)   (81)
                                       (331)   (422)   (432)
                                       (421)   (431)   (441)
                                       (511)   (521)   (522)
                                       (3211)  (611)   (531)
                                               (3221)  (621)
                                               (4211)  (711)
                                                       (3321)
                                                       (4221)
                                                       (4311)
                                                       (5211)
                                                       (32211)

The narrow instead of strict version is A332272.
A wide instead of strict version is A332295(n) - 1 for n > 1.
Cf. A107429, A181819, A316496, A317081, A317245, A317491, A329744, A329746, A329766, A332277, A332576.

normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
recnQ[ptn_]:=With[{qtn=Length/@Split[ptn]},Or[ptn=={},UnsameQ@@qtn,And[normQ[qtn],recnQ[qtn]]]];
Table[Length[Select[IntegerPartitions[n],recnQ]],{n,0,30}]

A335443 Number of compositions of n where neighboring runs have different lengths.

Original entry on oeis.org

1, 1, 2, 2, 5, 8, 13, 24, 42, 68, 122, 210, 360, 622, 1077, 1858, 3198, 5519, 9549, 16460, 28386, 49031, 84595, 145988, 251956, 434805, 750418, 1294998, 2234971, 3857106, 6656383, 11487641, 19825318, 34214136, 59046458, 101901743, 175860875, 303498779

Offset: 0

Alois P. Heinz, Jul 06 2020

nonn

			a(0) = 1: the empty composition.
a(1) = 1: 1.
a(2) = 2: 2, 11.
a(3) = 2: 3, 111.
a(4) = 5: 4, 22, 112, 211, 1111.
a(5) = 8: 5, 113, 122, 221, 311, 1112, 2111, 11111.
a(6) = 13: 6, 33, 114, 222, 411, 1113, 1221, 2112, 3111, 11112, 11211, 21111, 111111.
a(7) = 24: 7, 115, 133, 223, 322, 331, 511, 1114, 1222, 2113, 2221, 3112, 4111, 11113, 11122, 11311, 21112, 22111, 31111, 111112, 111211, 112111, 211111, 1111111.
a(8) = 42: 8, 44, 116, 224, 233, 332, 422, 611, 1115, 1223, 1331, 2114, 2222, 3113, 3221, 4112, 5111, 11114, 11222, 11411, 12221, 21113, 22211, 31112, 41111, 111113, 111122, 111221, 111311, 112112, 113111, 122111, 211112, 211211, 221111, 311111, 1111112, 1111211, 1112111, 1121111, 2111111, 11111111.

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Cf. A003242, A011782, A329738, A329739, A329748, A329749, A329766, A335942.

b:= proc(n, l, t) option remember; `if`(n=0, 1, add(add(
      `if`(j=t, 0, b(n-i*j, i, j)), j=1..n/i), i={$1..n} minus {l}))
    end:
a:= n-> b(n, 0$2):
seq(a(n), n=0..40);

b[n_, l_, t_] := b[n, l, t] = If[n == 0, 1, Sum[Sum[If[j == t, 0,
     b[n-i*j, i, j]], {j, 1, n/i}], {i, Range[n]~Complement~{l}}]];
a[n_] := b[n, 0, 0];
Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Apr 13 2022, after Alois P. Heinz *)

cp's OEIS Frontend

A333191 Number of compositions of n whose run-lengths are either strictly increasing or strictly decreasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A329741 Number of compositions of n whose multiplicities cover an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A332272 Number of narrowly recursively normal integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A329748 Number of complete compositions of n whose multiplicities cover an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A333192 Number of compositions of n with strictly increasing run-lengths.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A329749 Number of complete compositions of n whose run-lengths cover an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A332871 Number of compositions of n whose run-lengths are not weakly increasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A330937 Number of strictly recursively normal integer partitions of n.

Views

Author

Keywords