In this paper we provide a bijective proof for the theorem 3.1 of Andrews . This theorem involves the number of semi-Fibonacci partitions and the number of binary partitions in which each part appears an odd number of times.
Keywords and Phrases
Integer Partitions, Semi-Fibonacci, Binary Partitions, Bijective Proof, Partition Identities.
A.M.S. subject classiﬁcation
05A17, 11P82, 11P84.