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.

A129709 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 011 subwords (0<=k<=floor(n/3)). A Fibonacci binary word is a binary word having no 00 subword.

Table of values

n a(n)
0 1
1 2
2 3
3 4
4 1
5 5
6 3
7 6
8 7
9 7
10 13
11 1
12 8
13 22
14 4
15 9
16 34
17 12
18 10
19 50
20 28
21 1
22 11
23 70
24 58
25 5
26 12
27 95
28 108
29 18
30 13
31 125
32 188
33 50
34 1
35 14
36 161
37 308
38 121
39 6
40 15
41 203
42 483
43 261
44 25
45 16
46 252
47 728
48 520
49 80
50 1
51 17
52 308
53 1064
54 968
55 220
56 7
57 18
58 372
59 1512
60 1710
61 536
62 33
63 19
64 444
65 2100

List of values

[1, 2, 3, 4, 1, 5, 3, 6, 7, 7, 13, 1, 8, 22, 4, 9, 34, 12, 10, 50, 28, 1, 11, 70, 58, 5, 12, 95, 108, 18, 13, 125, 188, 50, 1, 14, 161, 308, 121, 6, 15, 203, 483, 261, 25, 16, 252, 728, 520, 80, 1, 17, 308, 1064, 968, 220, 7, 18, 372, 1512, 1710, 536, 33, 19, 444, 2100]