Efficient computation of the overpartition function and applications (Q6115647)

The main goal of this article is to give an efficient algorithm for computing the number of overpartitions of \(n\), analogous to the one given by \textit{F. Johansson} [LMS J. Comput. Math. 15, 341--359 (2012; Zbl 1344.11089)] for the number of partition of \(n\). In this context, the authors find many new Ramanujan-style congruences.