202

There are exactly 202 partitions of 32 (a power of two) into smaller powers of two. There are also 202 distinct (non-congruent) polygons that can be formed by connecting all eight vertices of a regular octagon into a cycle, and 202 distinct (non-isomorphic) directed graphs on four unlabeled vertices, not having any isolated vertices