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.

A234591 Number of binary words of length n which have no 0^b 1 1 0^a 1 0 1 0^b - matches, where a=1, b=2.

Table of values

n a(n)
0 1
1 2
2 4
3 8
4 16
5 32
6 64
7 128
8 256
9 512
10 1023
11 2044
12 4084
13 8160
14 16304
15 32576
16 65088
17 130048
18 259841
19 519173
20 1037329
21 2072626
22 4141192
23 8274272
24 16532336
25 33032288
26 65999871
27 131870458
28 263482601
29 526449078
30 1051866919
31 2101673384
32 4199229896
33 8390234112

List of values

[1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1023, 2044, 4084, 8160, 16304, 32576, 65088, 130048, 259841, 519173, 1037329, 2072626, 4141192, 8274272, 16532336, 33032288, 65999871, 131870458, 263482601, 526449078, 1051866919, 2101673384, 4199229896, 8390234112]