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.

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

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 1
10 2
11 3
12 4
13 5
14 6
15 7
16 8
17 10
18 14
19 20
20 28
21 38
22 50
23 64
24 80
25 99
26 123
27 155
28 198
29 255
30 329
31 423
32 540
33 684
34 861
35 1080
36 1354
37 1700
38 2139
39 2696
40 3400
41 4285
42 5392
43 6772
44 8490
45 10630
46 13300
47 16637
48 20812
49 26036
50 32568
51 40726
52 50902
53 63582
54 79372

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 14, 20, 28, 38, 50, 64, 80, 99, 123, 155, 198, 255, 329, 423, 540, 684, 861, 1080, 1354, 1700, 2139, 2696, 3400, 4285, 5392, 6772, 8490, 10630, 13300, 16637, 20812, 26036, 32568, 40726, 50902, 63582, 79372]