Number of binary words of length n containing at least one subword 10^{8}1 and no subwords 10^{i}1 with i<8.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 15, 21, 29, 39, 51, 65, 81, 99, 120
1 seqfan posts
Sat May 2 16:12:32 CEST 2009 [seqfan] Re: OEIS duplicate hunt