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.

A130902 a(n) is the number of binary strings of length n such that there exist 4 or more ones in a subsequence of length 5 or less.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 6
5 16
6 39
7 91
8 207
9 463
10 1014
11 2188
12 4671
13 9888
14 20786
15 43435
16 90302
17 186934
18 385547
19 792642
20 1625035
21 3323393
22 6782041
23 13813588
24 28087444
25 57023945
26 115614136
27 234117510
28 473564782
29 956961354
30 1932059363
31 3897575310
32 7856867785
33 15827584881

List of values

[0, 0, 0, 1, 6, 16, 39, 91, 207, 463, 1014, 2188, 4671, 9888, 20786, 43435, 90302, 186934, 385547, 792642, 1625035, 3323393, 6782041, 13813588, 28087444, 57023945, 115614136, 234117510, 473564782, 956961354, 1932059363, 3897575310, 7856867785, 15827584881]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.