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.

A234590 Number of binary words of length n which have no 0^b 1 1 0^a 1 0 1 0^b - matches, where a=0, 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 511
10 1020
11 2036
12 4064
13 8112
14 16192
15 32320
16 64513
17 128773
18 257041
19 513074
20 1024136
21 2044256
22 4080496
23 8144991
24 16258042
25 32452329
26 64777398
27 129300775
28 258094504
29 515176904
30 1028333569
31 2052634583
32 4097219870
33 8178372713

List of values

[1, 2, 4, 8, 16, 32, 64, 128, 256, 511, 1020, 2036, 4064, 8112, 16192, 32320, 64513, 128773, 257041, 513074, 1024136, 2044256, 4080496, 8144991, 16258042, 32452329, 64777398, 129300775, 258094504, 515176904, 1028333569, 2052634583, 4097219870, 8178372713]