cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A143284 Number of binary words of length n containing at least one subword 100001 and no subwords 10^{i}1 with i<4.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 2
8 3
9 4
10 5
11 7
12 11
13 17
14 25
15 35
16 48
17 66
18 92
19 129
20 180
21 249
22 342
23 468
24 640
25 875
26 1195
27 1629
28 2216
29 3009
30 4080
31 5526
32 7477
33 10107
34 13649
35 18415
36 24823
37 33433
38 44995
39 60513
40 81330
41 109241
42 146644
43 196742
44 263813
45 353570
46 473640
47 634201

List of values

[0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 7, 11, 17, 25, 35, 48, 66, 92, 129, 180, 249, 342, 468, 640, 875, 1195, 1629, 2216, 3009, 4080, 5526, 7477, 10107, 13649, 18415, 24823, 33433, 44995, 60513, 81330, 109241, 146644, 196742, 263813, 353570, 473640, 634201]