OFFSET
0,3
COMMENTS
A composition of n is a finite sequence of positive integers summing to n.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Unimodal Sequence
EXAMPLE
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).
MATHEMATICA
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], Or[LessEqual@@Length/@Split[#], GreaterEqual@@Length/@Split[#]]&]], {n, 0, 20}]
CROSSREFS
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.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Feb 29 2020
EXTENSIONS
Terms a(21) and beyond from Andrew Howroyd, Dec 30 2020
STATUS
approved