Recurrence relation for computing a bipartition function

Source abstract

Recently, Merca found the recurrence relation for computing the partition function $p(n)$ which requires only the values of $p(k)$ for $k\leq n/2$. In this article, we find the recurrence relation to compute the bipartition function $p_{-2}(n)$ which requires only the values of $p_{-2}(k)$ for $k\leq n/2$. In addition, we also find recurrences for $p(n)$ and $q(n)$ (number of partitions of $n$ into distinct parts), relations connecting $p(n)$ and $q_0(n)$ (number of partitions of $n$ into distinct odd parts).