OFFSET
0,5
COMMENTS
All such partitions have odd length.
We define the alternating product of a sequence (y_1,...,y_k) to be Product_i y_i^((-1)^(i-1)). The reverse-alternating product is the alternating product of the reversed sequence.
EXAMPLE
The a(2) = 1 through a(9) = 11 partitions:
(2) (3) (4) (5) (6) (7) (8) (9)
(211) (311) (222) (322) (332) (333)
(321) (421) (422) (432)
(411) (511) (431) (522)
(21111) (31111) (521) (531)
(611) (621)
(22211) (711)
(32111) (32211)
(41111) (42111)
(2111111) (51111)
(3111111)
MATHEMATICA
altprod[q_]:=Product[q[[i]]^(-1)^(i-1), {i, Length[q]}];
Table[Length[Select[IntegerPartitions[n], altprod[Reverse[#]]>1&]], {n, 0, 30}]
CROSSREFS
The strict case is A067659, except that a(0) = a(1) = 0.
The even bisection is A236559.
The case of >= 1 instead of > 1 is A344607.
The opposite version is A344608, also the non-reverse even-length case.
Allowing any integer reverse-alternating product gives A347445.
Allowing any integer alternating product gives A347446.
Reverse version of A347448; also the odd-length case.
The Heinz numbers of these partitions are the complement of A347450.
The multiplicative version (factorizations) is A347705.
A000041 counts partitions.
A027187 counts partitions of even length.
A027193 counts partitions of odd length.
A100824 counts partitions of n with alternating sum <= 1.
A347462 counts possible reverse-alternating products of partitions.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 16 2021
STATUS
approved