Divisibility of Andrews' singular overpartitions by powers of 2 and 3

From MaRDI portal
Publication:2316348



Abstract: Andrews introduced the partition function overlineCk,i(n), called singular overpartition, which counts the number of overpartitions of n in which no part is divisible by k and only parts equivpmipmodk may be overlined. He also proved that overlineC3,1(9n+3) and overlineC3,1(9n+6) are divisible by 3 for ngeq0. Recently Aricheta proved that for an infinite family of k, overlineC3k,k(n) is almost always even. In this paper, we prove that for any positive integer k, overlineC3,1(n) is almost always divisible by 2k and 3k.












This page was built for publication: Divisibility of Andrews' singular overpartitions by powers of 2 and 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316348)