OFFSET
0,5
COMMENTS
Also the number of weakly alternating non-strict integer partitions of n, where we define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either. This sequence looks at the somewhat degenerate case where no strict increases are allowed. Equivalently, these are partitions that are weakly alternating but not strongly alternating.
FORMULA
EXAMPLE
The a(2) = 1 through a(8) = 14 partitions:
(11) (111) (22) (221) (33) (322) (44)
(211) (311) (222) (331) (332)
(1111) (2111) (411) (511) (422)
(11111) (2211) (2221) (611)
(3111) (4111) (2222)
(21111) (22111) (3221)
(111111) (31111) (3311)
(211111) (5111)
(1111111) (22211)
(41111)
(221111)
(311111)
(2111111)
(11111111)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], !UnsameQ@@#&&(SameQ@@#||And@@EvenQ/@Take[Length/@Split[#], {2, -2}])&]], {n, 0, 30}]
CROSSREFS
This is the restriction of A349060 to non-strict partitions.
The complement in non-strict partitions is A349796.
Permutations of prime factors of this type are counted by A349798.
These partitions are ranked by A350137.
A096441 counts weakly alternating 0-appended partitions.
A349801 counts non-alternating partitions.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Dec 06 2021
STATUS
approved