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.

A005943 Factor complexity (number of subwords of length n) of the Golay-Rudin-Shapiro binary word A020987.

Table of values

n a(n)
0 1
1 2
2 4
3 8
4 16
5 24
6 36
7 46
8 56
9 64
10 72
11 80
12 88
13 96
14 104
15 112
16 120
17 128
18 136
19 144
20 152
21 160
22 168
23 176
24 184
25 192
26 200
27 208
28 216
29 224
30 232
31 240
32 248
33 256
34 264
35 272
36 280
37 288
38 296
39 304
40 312
41 320
42 328
43 336
44 344
45 352
46 360
47 368
48 376
49 384
50 392
51 400
52 408
53 416
54 424
55 432
56 440
57 448
58 456
59 464
60 472
61 480
62 488
63 496
64 504

List of values

[1, 2, 4, 8, 16, 24, 36, 46, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 136, 144, 152, 160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280, 288, 296, 304, 312, 320, 328, 336, 344, 352, 360, 368, 376, 384, 392, 400, 408, 416, 424, 432, 440, 448, 456, 464, 472, 480, 488, 496, 504]