Congruences modulo powers of 3 for 2-color partition triples (Q2317463): Difference between revisions

Consider triples of partitions of an integer $n$ into two colors, where one of the colors appears only in parts that are multiples of $k$. The generating functions for the number of such partitions is $$ \sum_{n=0}^{\infty}p_{k,3}(n)q^n=\frac{1}{(q;q)_{\infty}^3 (q^k;q^k)_{\infty}^3}=\prod_{n=0}^{\infty}(1-q^{n+1})^{-3}(1-q^{kn+k})^{-3}.$$ For example, for $k=3$ we get $$ 1+3 q+9 q^2+25 q^3+60 q^4+135 q^5+296 q^6+609 q^7+1215 q^8+2362 q^9+\cdots. $$ The author uses techniques developed in \textit{S. Chern} and \textit{C. Wang} [``Ramanujan-type congruences for 2-color partition triples'', Preprint, \url{arXiv:1706.05667}] and \textit{M. D. Hirschhorn} [Ramanujan J. 45, No. 2, 517--520 (2018; Zbl 1420.11131)], to obtain several congruence conditions for some special coefficients of $p_{1,3}$, $p_{3,3}$, $p_{9,3}$, via $q$-series manipulations. For example, $$ p_{3,3}\left(3^\alpha n+\frac{3^\alpha +1}{2}\right)\equiv 0 \pmod{3^{\alpha+1}}.$$