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).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 303-310 |
| Number of pages | 8 |
| Journal | Discrete Mathematics |
| Volume | 156 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Sep 1 1996 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Recurrences for 2-colored and 3-colored F-partitions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver