  We consider partial words with a unique position starting a power. We show
that over a $k$ letter alphabet, a partial word with a unique position starting
a square can contain at most $k$ squares. This is in contrast to full words
which can contain at most one power if a unique position starts a power. For
certain higher powers we exhibit binary partial words containing three powers
all of which start at the same position.
