Congruences involving F-partition functions (Q1321871): Difference between revisions

Summary: The primary goal of this note is to prove the congruence \(\phi_3(3n+ 2)\equiv 0\pmod 3\), where \(\phi_3(n)\) denotes the number of F-partitions of \(n\) with at most 3 repetitions. Secondarily, we conjecture a new family of congruences involving \(c\phi_2(n)\), the number of F-partitions of \(n\) with 2 colors.