Differences of even and odd numbers of parts of the cubic and analogous partition functions (Q6186411)

The cubic partition function \(a(n)\) counts the number of partitions of a positive integer \(n\) in which even parts can appear in two colors. In a recent paper, the reviewer [Ramanujan J. 59, No. 1, 253--277 (2022; Zbl 1504.11108)] introduced and investigated the function \(A(n)\), which is defined as the difference between the number of cubic partitions of \(n\) into an even number of parts and the number of cubic partitions of \(n\) into an odd number of parts. In his paper, Merca founded the generating function of \(A(n)\) and derived two congruences modulo \(3\) for \(A(n)\) by using Smoot's RaduRK Mathematica package. By employing generating function manipulations and dissections, \textit{R. da Silva} and \textit{J. A. Sellers} [Ramanujan J. 62, No. 4, 925--933 (2023; Zbl 07784971)] reproved these congruences, along with the discovery of two infinite families of modulo \(3\) congruences arising from them. In this paper, the authors introduce simplified formulas for the generating functions, which lead naturally to proofs of the congruences established by Merca, as well as those by da Silva and Sellers.