In this paper we give a bijective proof of the new identity B_4,2,2(n), where counts the number of partitions of n subject to certain restrictions on their parts (too long to be stated in the abstract) and B_4,2,2(n) counts the number of partitions of n = b₁ + ×¼span style="mso-char-type:symbol;mso-symbol-font-family:Symbol">×— + b_s into distinct parts with parts ? 2, 3 and b_i ? b_i+1 ? 5 with strict inequality if b_i is a multiple of 5.

integer partitions, bijective proof.