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.

A261711 Triangle read by rows: T(n,k) is the number of words over alphabet {0,1,2,3} having exactly k occurrences of the string 01, where n>=0 and k>=0.

Table of values

n a(n)
0 1
1 4
2 15
3 1
4 56
5 8
6 209
7 46
8 1
9 780
10 232
11 12
12 2911
13 1091
14 93
15 1
16 10864
17 4912
18 592
19 16
20 40545
21 21468
22 3366
23 156
24 1
25 151316
26 91824
27 17784
28 1200
29 20
30 564719
31 386373
32 89238
33 8010
34 235
35 1
36 2107560
37 1604984
38 430992
39 48624
40 2120
41 24
42 7865521
43 6598282
44 2021103
45 275724
46 16255
47 330
48 1

List of values

[1, 4, 15, 1, 56, 8, 209, 46, 1, 780, 232, 12, 2911, 1091, 93, 1, 10864, 4912, 592, 16, 40545, 21468, 3366, 156, 1, 151316, 91824, 17784, 1200, 20, 564719, 386373, 89238, 8010, 235, 1, 2107560, 1604984, 430992, 48624, 2120, 24, 7865521, 6598282, 2021103, 275724, 16255, 330, 1]