Combinatorial Proofs of Two Euler-Type Identities Due to Andrews
Combinatorial Proofs of Two Euler-Type Identities Due to Andrews
Let a(n) be the number of partitions of n, such that the set of even parts has exactly one element, b(n) be the difference between the number of parts in all odd partitions of n and the number of parts in all distinct partitions of n, and c(n) be the …