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.

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

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 0
11 0
12 1
13 2
14 3
15 4
16 5
17 6
18 7
19 8
20 9
21 10
22 11
23 13
24 17
25 23
26 31
27 41
28 53
29 67
30 83
31 101
32 121
33 143
34 168
35 198
36 236
37 285
38 348
39 428
40 528
41 651
42 800
43 978
44 1188
45 1434
46 1722
47 2061
48 2464
49 2948
50 3534
51 4247
52 5116
53 6174
54 7458
55 9009
56 10873
57 13103
58 15762
59 18927

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 17, 23, 31, 41, 53, 67, 83, 101, 121, 143, 168, 198, 236, 285, 348, 428, 528, 651, 800, 978, 1188, 1434, 1722, 2061, 2464, 2948, 3534, 4247, 5116, 6174, 7458, 9009, 10873, 13103, 15762, 18927]