Counting Independent Sets in the Prism (Circular Ladder) Graph

Each rung pair holds at most one vertex, so a large independent set fixes which columns are used; the empty columns cut the rest into paths, and every path contributes a factor of $2$ (outer/inner must alternate).