Planar Graphs · Superchallenge problem

A connected simple planar graph is both a triangulation (every face a triangle) AND bipartite. For how many integers $V \ge 3$ can such a graph exist?