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.

A118646 a(n) is the number of binary strings of length n such that there exists a subsequence of length 4 containing 3 or more ones.

Table of values

n a(n)
1 0
2 0
3 1
4 5
5 13
6 31
7 71
8 159
9 346
10 739
11 1559
12 3258
13 6756
14 13922
15 28547
16 58300
17 118668
18 240880
19 487835
20 986085
21 1990025
22 4010658
23 8073786
24 16237521
25 32629241
26 65522823
27 131498801
28 263774439
29 528880599
30 1060044148
31 2124001923

List of values

[0, 0, 1, 5, 13, 31, 71, 159, 346, 739, 1559, 3258, 6756, 13922, 28547, 58300, 118668, 240880, 487835, 986085, 1990025, 4010658, 8073786, 16237521, 32629241, 65522823, 131498801, 263774439, 528880599, 1060044148, 2124001923]