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.

A277751 Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 01101; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows.

Table of values

n a(n)
0 1
1 2
2 4
3 8
4 16
5 31
6 1
7 60
8 4
9 116
10 12
11 225
12 30
13 1
14 436
15 72
16 4
17 845
18 166
19 13
20 1637
21 375
22 35
23 1
24 3172
25 828
26 92
27 4
28 6146
29 1802
30 230
31 14
32 11909
33 3872
34 562
35 40
36 1
37 23075
38 8243
39 1333
40 113
41 4
42 44711
43 17404
44 3106
45 300
46 15
47 86633
48 36501
49 7114
50 778
51 45
52 1
53 167863
54 76104

List of values

[1, 2, 4, 8, 16, 31, 1, 60, 4, 116, 12, 225, 30, 1, 436, 72, 4, 845, 166, 13, 1637, 375, 35, 1, 3172, 828, 92, 4, 6146, 1802, 230, 14, 11909, 3872, 562, 40, 1, 23075, 8243, 1333, 113, 4, 44711, 17404, 3106, 300, 15, 86633, 36501, 7114, 778, 45, 1, 167863, 76104]