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.

A120118 a(n) is the number of binary strings of length n such that no subsequence of length 5 or less contains 3 or more ones.

Table of values

n a(n)
0 1
1 2
2 4
3 7
4 11
5 16
6 26
7 43
8 71
9 116
10 186
11 300
12 487
13 792
14 1287
15 2087
16 3382
17 5484
18 8898
19 14438
20 23423
21 37993
22 61625
23 99965
24 162165
25 263065
26 426736
27 692229
28 1122903
29 1821538
30 2954849
31 4793266
32 7775472
33 12613097
34 20460538
35 33190414
36 53840404

List of values

[1, 2, 4, 7, 11, 16, 26, 43, 71, 116, 186, 300, 487, 792, 1287, 2087, 3382, 5484, 8898, 14438, 23423, 37993, 61625, 99965, 162165, 263065, 426736, 692229, 1122903, 1821538, 2954849, 4793266, 7775472, 12613097, 20460538, 33190414, 53840404]