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.

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

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 1
11 2
12 3
13 4
14 5
15 6
16 7
17 8
18 9
19 11
20 15
21 21
22 29
23 39
24 51
25 65
26 81
27 99
28 120
29 146
30 180
31 225
32 284
33 360
34 456
35 575
36 720
37 895
38 1106
39 1362
40 1676
41 2065
42 2550
43 3156
44 3912
45 4851
46 6011
47 7437
48 9184
49 11321
50 13936
51 17141
52 21077
53 25919
54 31881
55 39222
56 48254

List of values

[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, 146, 180, 225, 284, 360, 456, 575, 720, 895, 1106, 1362, 1676, 2065, 2550, 3156, 3912, 4851, 6011, 7437, 9184, 11321, 13936, 17141, 21077, 25919, 31881, 39222, 48254]