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.

A307795 Number of binary words of length n with three times as many occurrences of subword 101 as occurrences of subword 010.

Table of values

n a(n)
0 1
1 2
2 4
3 6
4 10
5 16
6 26
7 42
8 70
9 116
10 196
11 332
12 572
13 996
14 1758
15 3134
16 5650
17 10276
18 18836
19 34720
20 64310
21 119582
22 223066
23 417028
24 780876
25 1463800
26 2746304
27 5155556
28 9682418
29 18189458
30 34178904
31 64236714
32 120749592
33 227018306
34 426886298
35 802872340
36 1510325700

List of values

[1, 2, 4, 6, 10, 16, 26, 42, 70, 116, 196, 332, 572, 996, 1758, 3134, 5650, 10276, 18836, 34720, 64310, 119582, 223066, 417028, 780876, 1463800, 2746304, 5155556, 9682418, 18189458, 34178904, 64236714, 120749592, 227018306, 426886298, 802872340, 1510325700]

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

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