In this game there is an n X 2 grid where each square may or may not be filled. Each column and each row is labeled by the length of each successive block of filled squares, but without indication of the number of unfilled squares in between. The object is to determine which squares are filled.
The only ambiguous row hint is 1, which has the same solutions regardless of whether black or white squares are counted. So this is also the number of n X 2 "yesnograms".
