Further arithmetic properties of overcubic partition triples (Q6877618)

A cubic partition of \(n\) is a partition of \(n\) in which the even parts can appear in two colours. An overcubic partition of \(n\) is the number of overlined cubic partitions, that is, the cubic partitions where the first instance of each part is allowed to be overlined. Cubic partition pairs and overcubic partition pairs have been examined by \textit{H. Zhao} and \textit{Z. Zhong} [Electron. J. Comb. 18, No. 1, Research Paper P58, 9 p. (2011; Zbl 1220.05006)] and \textit{B. Kim} [Commun. Korean Math. Soc. 27, No. 3, 477--482 (2012; Zbl 1259.11097)]. The focus of this paper is the number of overcubic partition pairs of \(n\), denoted by \(\overline{b}(n)\), and triples, denoted by \(\overline{bt}(n)\). The results give congruences for \(\overline{b}(n)\) and \(\overline{bt}(n)\) modulo 2, 4, 8, 16, 32, 64, 128 and 384 and some conjectures such as \(\overline{bt}(144n+42)\equiv 0 \pmod{384}\) and \(\overline{bt}(2^a(72n+21)) \equiv 0 \pmod{128}\). It is also shown that the partition function \(\overline{bt}(n)\) is almost always divisible by \(2^k\) for \(k\ge 1\). Some of the congruences are proved by Smoot's implementation of Radu's algorithm and some by 2-dissections of the generating functions.