login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of "forceless" (or "useless") sequences in n-column Nonogram puzzle.
0

%I #8 May 08 2018 07:32:31

%S 0,1,1,3,3,7,8,15,20,33,47,75,110,172,259,401,612,947,1457,2258,3494,

%T 5428,8434,13138,20480,31982,49991,78244,122583,192255,301797,474190,

%U 745667,1173510,1848204,2912884,4593955,7249843,11448105,18087986,28594742,45228384,71573873,113320180,179498299,284449744

%N Number of "forceless" (or "useless") sequences in n-column Nonogram puzzle.

%H Ryan Mullen, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/Mullen/mullen2.html">On Determining Paint by Numbers Puzzles with Nonunique Solutions</a>, J. Integer Sequences 12 (2009), Article 09.6.5.

%H Daniel Berend and Shira Zucker, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL21/Zucker/zucker2.html">The Asymptotics of Useless Hint Sequences in Nonograms</a>, J. Integer Sequences 21 (2018), Article 18.4.2.

%K nonn

%O 1,4

%A _Jeffrey Shallit_, May 07 2018