A391619 Number of n X n nonograms (hanjie) which can be solved uniquely by iteratively analyzing each row and column in isolation, without guessing and backtracking.

1, 2, 14, 384, 51234, 24976511, 48625108931

Offset

0,2

Links

Table of n, a(n) for n=0..6.

K. Joost Batenburg and Walter A. Kosters, On the difficulty of nonograms, ICGA Journal, 35 (2012), 195-205; alternative link.

Philippe P. Bors, Analysis of nonsimple Nonograms, Thesis Bachelor Informatica, LIACS, Leiden University, 2020.

GitHub user olligobber, LocalNonogram, 2025-2026.

Joel Riley, Pixelogic Weekly #14, 2025.

Crossrefs

Cf. A242876.

Sequence in context: A385861 A011809 A228852 * A242876 A102596 A354465

Adjacent sequences: A391616 A391617 A391618 * A391620 A391621 A391622

Keyword

nonn,hard,more

Author

Andrei Zabolotskii, Jan 17 2026

Extensions

a(6) from Batenburg & Kosters and olligobber added by Andrei Zabolotskii, May 02 2026

Status

approved