Franklin's argument proves an identity of Zagier.
Chapman, Robin (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chapman, Robin (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mahadeb Dutta (1956)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Sellers, James A. (2003)
Integers
Similarity:
Fortin, J.-F., Jacob, P., Mathieu, P. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eichhorn, Dennis, McLaughlin, James, Sills, Andrew V. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Agarwal, A.K. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Subbarao, M.V. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Sellers, James A. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Sills, Andrew V. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Padmavathamma, Sudha, T.G. (1993)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Mateus Alegri, Wagner Ferreira Santos, Samuel Brito Silva (2021)
Czechoslovak Mathematical Journal
Similarity:
We provide combinatorial interpretations for three new classes of partitions, the so-called chromatic partitions. Using only combinatorial arguments, we show that these partition identities resemble well-know ordinary partition identities.
Ji, Kathy Qing (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Karol Pąk (2015)
Formalized Mathematics
Similarity:
In this article we prove the Euler’s Partition Theorem which states that the number of integer partitions with odd parts equals the number of partitions with distinct parts. The formalization follows H.S. Wilf’s lecture notes [28] (see also [1]). Euler’s Partition Theorem is listed as item #45 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/ [27].