A385861 Number of n X n yesnograms that can be solved uniquely.
1, 2, 14, 368, 49578, 24177516, 46985524156
Offset: 0
Examples
a(2) = 14 because, of the 16 2 X 2 grids, 10/01 and 01/10 would have the same set of clues; the other 14 are solvable.
Links
- Bertram Felgenhauer, Counting Nonograms.
- Wikipedia, Nonogram.
Comments