RECURRENCES FOR 2–COLORED AND 3–COLORED F–PARTITIONS

Abstract. The goal of this paper is to prove new recurrences involving 2–colored and 3–colored generalized Frobenius partitions of n similar to the classical recurrence for the partition function p(n). Section 1. Introduction. For many years, recurrences for partition functions have been widely used to compute the values of the functions in a straightforward manner. The classical example of a partition function recurrence involves the function p(n)