login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A304179
Number of "forceless" (or "useless") sequences in n-column Nonogram puzzle.
0
0, 1, 1, 3, 3, 7, 8, 15, 20, 33, 47, 75, 110, 172, 259, 401, 612, 947, 1457, 2258, 3494, 5428, 8434, 13138, 20480, 31982, 49991, 78244, 122583, 192255, 301797, 474190, 745667, 1173510, 1848204, 2912884, 4593955, 7249843, 11448105, 18087986, 28594742, 45228384, 71573873, 113320180, 179498299, 284449744
OFFSET
1,4
LINKS
Ryan Mullen, On Determining Paint by Numbers Puzzles with Nonunique Solutions, J. Integer Sequences 12 (2009), Article 09.6.5.
Daniel Berend and Shira Zucker, The Asymptotics of Useless Hint Sequences in Nonograms, J. Integer Sequences 21 (2018), Article 18.4.2.
CROSSREFS
Sequence in context: A110618 A320291 A320294 * A182559 A108046 A286110
KEYWORD
nonn
AUTHOR
Jeffrey Shallit, May 07 2018
STATUS
approved