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.

A234592 Number of binary words of length n which have no 0^b 1 1 0^a 1 0 1 0^b - matches, where a=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 1024
11 2047
12 4092
13 8180
14 16352
15 32688
16 65344
17 130624
18 261120
19 521984
20 1043457
21 2085893
22 4169745
23 8335410
24 16662664
25 33309024
26 66585456
27 133105760
28 266081280
29 531902207
30 1063283962
31 2125527529
32 4248975286
33 8493793063

List of values

[1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2047, 4092, 8180, 16352, 32688, 65344, 130624, 261120, 521984, 1043457, 2085893, 4169745, 8335410, 16662664, 33309024, 66585456, 133105760, 266081280, 531902207, 1063283962, 2125527529, 4248975286, 8493793063]