Elementary proofs of infinite families of congruences for Merca's cubic partitions

Recently, using modular forms and Smoot's Mathematica implementation of Radu's algorithm for proving partition congruences, Merca proved the following two congruences: for all n >= 0, A(9n + 5) = 0 (mod 3), A(27n + 26) = 0 (mod 3). Here, A(n) is closely related to the function which counts the number of cubic partitions, partitions wherein the even parts are allowed to appear in two different colors. Indeed, A(n) is defined as the difference between the number of cubic partitions of n into an even numbers of parts and the number of cubic partitions of n into an odd numbers of parts. In this brief note, we provide elementary proofs of these two congruences via classical generating function manipulations. We then prove two infinite families of non-nested Ramanujan-like congruences modulo 3 satisfied by A(n) whereinMerca's original two congruences serve as the initial members of each family.