A COMBINATORIAL PROOF FOR A RELATION BETWEEN CERTAIN TYPES OF INTEGERS
Let denote the number of representations of integer n as a sum of k squares and denote the number of representations of integer n as a sum of k centered pentagonal numbers. We give a combinatorial proof for the relation where for The combinatorial proof for all integers n and where and is also given.
combinatorial proof, number of representations, sum of squares, centered pentagonal numbers.