OFFSET
0,3
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..700
FORMULA
See Sage code for the formula. - Max Alekseyev, Oct 31 2024
EXAMPLE
The a(1) = 1 through a(6) = 19 compositions:
(1) (2) (3) (4) (5) (6)
(11) (12) (13) (14) (15)
(21) (22) (23) (24)
(111) (31) (32) (33)
(121) (41) (42)
(211) (131) (51)
(1111) (212) (141)
(221) (222)
(311) (231)
(1211) (312)
(2111) (321)
(11111) (411)
(1311)
(2121)
(2211)
(3111)
(12111)
(21111)
(111111)
For example, (2,3,1,2) is such a composition, because the non-adjacent pairs of parts are (2,1), (2,2), (3,2), all of which are weakly decreasing.
MATHEMATICA
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], !MatchQ[#, {___, x_, __, y_, ___}/; y>x]&]], {n, 0, 15}]
PROG
(Sage) def a333148(n): return number_of_partitions(n) + sum( Partitions(m, max_part=l, length=k).cardinality() * Partitions(n-m-l^2, min_length=k+2*l).cardinality() for l in range(1, (n+1).isqrt()) for m in range((n-l^2-2*l)*l//(l+1)+1) for k in range(ceil(m/l), min(m, n-m-l^2-2*l)+1) ) # Max Alekseyev, Oct 31 2024
CROSSREFS
Unimodal compositions are A001523.
The case of normal sequences appears to be A028859.
A version for ordered set partitions is A332872.
The case of strict compositions is A333150.
The version for strictly decreasing parts is A333193.
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 16 2020
EXTENSIONS
Edited and terms a(21)-a(51) added by Max Alekseyev, Oct 30 2024
STATUS
approved