This one we verify by inspection.

If `n==1`

, we yield `[False]`

, then
`[True]`

.

If `n>1`

, we generate a sequence like this:

(the first permutation of

`n-1`

)+`[False]`

(the first permutation of

`n-1`

)+`[True]`

(the second permutation of

`n-1`

)+`[False]`

(the second permutation of

`n-1`

)+`[True]`

and so on.