NOTE: After edit question became about set partitions, which not was I intended, so this is second try.

Is there an algorithm for producing an infinite subset of set of integer partition numbers p(n) such that all elements of this subset are even and we don't need to use some sieve (for example, find all elements of p(n) and then throw out odd). I don't necessarily need all even p(n), just infinite subset of them.