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.

A260505 Number of binary words of length n with exactly one occurrence of subword 010 and exactly two occurrences of subword 101.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 1
6 2
7 7
8 16
9 38
10 82
11 175
12 362
13 736
14 1468
15 2885
16 5596
17 10736
18 20398
19 38423
20 71818
21 133307
22 245890
23 450970
24 822788
25 1493992
26 2700800
27 4862566
28 8721608
29 15588371
30 27770338
31 49320863
32 87344004
33 154263972
34 271765362
35 477622769
36 837519742
37 1465470968

List of values

[0, 0, 0, 0, 0, 1, 2, 7, 16, 38, 82, 175, 362, 736, 1468, 2885, 5596, 10736, 20398, 38423, 71818, 133307, 245890, 450970, 822788, 1493992, 2700800, 4862566, 8721608, 15588371, 27770338, 49320863, 87344004, 154263972, 271765362, 477622769, 837519742, 1465470968]

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

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