Originally asked by Ali Dino Jumani; EXTENSIVELY EDITED by David Speyer. The previous version was a bit confused, but Steven Sivek and Graham, in the comments, figured out what was going on.

G. C. Shephard, in his paper "Twenty Problems on Convex Polyhedra: Part I", associates to a three dimensional polyhedron the sequence $(p_3, p_4, p_5, p_6, \ldots)$, with $p_k$ being the number of facets that are $k$-gons. He poses the problem of characterizing all sequences of integers which arise in this way.

Are there any developments and references on this problem?

the original question as appeared in Shephard's paper "Given any finite sequence (f3, f4, ...., fm) of non-negative integers, find a necessary and sufficient condition for it to be assocoated with some convex polyhedron". Following Grunbaum's Convex Polytope 2e notation, section 13.3 under Eberhard's Therorem heading, f3 is triangle renamed as p3 and f4 as p4 is square and fm as pk is n-gon. A convex polyhedron containing these faces satisfies the Eberhard's criterion. Revisions and corrections are highly appreciated, Thanks.