P360: Enumeration of all necklaces of length $n$ with two colors

P360: Enumeration of all necklaces of length $n$ with two colors

Input:

An integer $n$.

Output:

All necklaces of length $n$ with two colors.

Complexity:

Comment:

Reference:

[Fredricksen1986b] (Bibtex)