Number of binary words of length n containing at least one subword 10^{9}1 and no subwords 10^{i}1 with i<9.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 16, 22, 30, 40, 52, 66, 82
1 seqfan posts
Sat May 2 16:12:32 CEST 2009 [seqfan] Re: OEIS duplicate hunt