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 A385862 #13 Aug 19 2025 23:06:01 %S A385862 1,1,1,1,2,1,1,4,4,1,1,8,14,8,1,1,16,52,52,16,1,1,32,210,368,210,32,1, %T A385862 1,64,816,2992,2992,816,64,1,1,128,3206,23058,49578,23058,3206,128,1, %U A385862 1,256,12536,179576,775204,775204,179576,12536,256,1,1,512,48962,1388978,12129616,24177516,12129616,1388978,48962,512,1 %N A385862 Number of n X m yesnograms that can be solved uniquely, read by antidiagonals. %C A385862 In a nonogram puzzle, there is a hidden bitonal grid (or 0/1 matrix), and each row and each column is labeled by the length of each successive block of foreground pixels, but without indication of the number of background pixels separating them; the object is to determine the grid contents. In this variant, called a "yesnogram", the pixel value that represents foreground for row clues is the complement of the value that represents foreground for column clues. %H A385862 Bertram Felgenhauer, <a href="/A385862/b385862.txt">Antidiagonals n+m = 0..13, flattened</a> %H A385862 Bertram Felgenhauer, <a href="https://int-e.eu/nono/">Counting Nonograms</a>. %H A385862 Wikipedia, <a href="https://en.wikipedia.org/wiki/Nonogram">Nonogram</a>. %F A385862 A(0,n) = 1, and A(1,n) = 2^n. A(n,m) = A(m,n), because a grid is solvable iff its complement-transpose is solvable. %e A385862 For the 3 X 4 grid shown below, the row clues (counting runs of 0s) and the column clues (counting runs of 1s) are sufficient to reconstruct the grid, so this is one of the 2992 solvable grids counted in A(3, 4). %e A385862 | 1 3 1 2 %e A385862 ----+-------- %e A385862 1 | 0 1 1 1 %e A385862 1 1 | 0 1 0 1 %e A385862 2 | 1 1 0 0 %e A385862 Top left corner of the array: %e A385862 1, 1, 1, 1, 1, 1, 1, ... %e A385862 1, 2, 4, 8, 16, 32, 64, ... %e A385862 1, 4, 14, 52, 210, 816, 3206, ... %e A385862 1, 8, 52, 368, 2992, 23058, 179576, ... %e A385862 1, 16, 210, 2992, 49578, 775204, 12129616, ... %e A385862 1, 32, 816, 23058, 775204, 24177516, 754845831, ... %Y A385862 Cf. A242876 (solvable n X n nonograms), A384764 (solvable n X m nonograms), A383345 (solvable n X 2 nonograms or yesnograms), A385861 (solvable n X n yesnograms). %K A385862 nonn,tabl %O A385862 0,5 %A A385862 _Karl W. Heuer_, Aug 06 2025