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.

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

Table of values

n a(n)
1 2
2 4
3 8
4 15
5 26
6 48
7 89
8 165
9 305
10 561
11 1034
12 1908
13 3521
14 6496
15 11982
16 22101
17 40770
18 75210
19 138741
20 255934
21 472117
22 870911
23 1606567
24 2963628
25 5466988
26 10084919
27 18603592
28 34317946
29 63306130
30 116780470
31 215424285
32 397391986
33 733066807

List of values

[2, 4, 8, 15, 26, 48, 89, 165, 305, 561, 1034, 1908, 3521, 6496, 11982, 22101, 40770, 75210, 138741, 255934, 472117, 870911, 1606567, 2963628, 5466988, 10084919, 18603592, 34317946, 63306130, 116780470, 215424285, 397391986, 733066807]