cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A385861 Number of n X n yesnograms that can be solved uniquely.

Original entry on oeis.org

1, 2, 14, 368, 49578, 24177516, 46985524156
Offset: 0

Views

Author

Karl W. Heuer, Aug 06 2025

Keywords

Comments

A nonogram provides row and column clues indicating runs of black pixels, treating white as blank. In this variant (called a "yesnogram"), the row clues instead indicate runs of white pixels, treating black as blank. Column clues remain unchanged from the standard nonogram.

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.
		

Crossrefs

Main diagonal of A385862.
Cf. A242876 (solvable n X n nonograms), A384764 (solvable n X m nonograms), A383345 (solvable n X 2 nonograms or yesnograms).