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.

A307796 Number T(n,k) of binary words of length n such that k is the difference of numbers of occurrences of subword 101 and subword 010; triangle T(n,k), n>=0, -floor(n/3)<=k<=floor(n/3), read by rows.

Table of values

n a(n)
0 1
1 2
2 4
3 1
4 6
5 1
6 2
7 12
8 2
9 6
10 20
11 6
12 1
13 12
14 38
15 12
16 1
17 3
18 28
19 66
20 28
21 3
22 10
23 56
24 124
25 56
26 10
27 1
28 24
29 119
30 224
31 119
32 24
33 1
34 4
35 60
36 236
37 424
38 236
39 60
40 4
41 15
42 134
43 481
44 788
45 481
46 134
47 15
48 1
49 42
50 304
51 950
52 1502
53 950
54 304
55 42
56 1
57 5
58 114
59 656
60 1902
61 2838
62 1902
63 656
64 114
65 5

List of values

[1, 2, 4, 1, 6, 1, 2, 12, 2, 6, 20, 6, 1, 12, 38, 12, 1, 3, 28, 66, 28, 3, 10, 56, 124, 56, 10, 1, 24, 119, 224, 119, 24, 1, 4, 60, 236, 424, 236, 60, 4, 15, 134, 481, 788, 481, 134, 15, 1, 42, 304, 950, 1502, 950, 304, 42, 1, 5, 114, 656, 1902, 2838, 1902, 656, 114, 5]