Answers are grounded in this paper and cite their sources.
Let G(n) denote the number of partitions of n into distinct parts which are of the form 2m, 3m, 5m, 6m-3, 8m-3, 9m-3 or 11m-3 with parts of the form 2m, 3m, 6m-3, or 11m-3 being even in number minus the number of them with parts of the form 2m, 3m, 6m-3, or 11m-3 being odd in number. In this paper, we prove that G(n) assumes all integral values and does so infinitely often.
No takes yet. Share an insight, caveat, or question.
Manvendra Tamba (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: