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.

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

Table of values

n a(n)
1 0
2 0
3 1
4 5
5 16
6 38
7 85
8 185
9 396
10 838
11 1748
12 3609
13 7400
14 15097
15 30681
16 62154
17 125588
18 253246
19 509850
20 1025153
21 2059159
22 4132679
23 8288643
24 16615051
25 33291367
26 66682128
27 133525499
28 267312553
29 535049374
30 1070786975
31 2142690382

List of values

[0, 0, 1, 5, 16, 38, 85, 185, 396, 838, 1748, 3609, 7400, 15097, 30681, 62154, 125588, 253246, 509850, 1025153, 2059159, 4132679, 8288643, 16615051, 33291367, 66682128, 133525499, 267312553, 535049374, 1070786975, 2142690382]

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

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