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.
%I A385861 #9 Aug 14 2025 15:28:56 %S A385861 1,2,14,368,49578,24177516,46985524156 %N A385861 Number of n X n yesnograms that can be solved uniquely. %C A385861 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. %H A385861 Bertram Felgenhauer, <a href="https://int-e.eu/nono/">Counting Nonograms</a>. %H A385861 Wikipedia, <a href="https://en.wikipedia.org/wiki/Nonogram">Nonogram</a>. %e A385861 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. %Y A385861 Main diagonal of A385862. %Y A385861 Cf. A242876 (solvable n X n nonograms), A384764 (solvable n X m nonograms), A383345 (solvable n X 2 nonograms or yesnograms). %K A385861 nonn,more %O A385861 0,2 %A A385861 _Karl W. Heuer_, Aug 06 2025