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.

A129714 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs (0<=k<=n). A Fibonacci binary word is a binary word having no 00 subword. A run is a maximal sequence of consecutive identical letters.

Table of values

n a(n)
0 1
1 0
2 2
3 0
4 1
5 2
6 0
7 1
8 2
9 2
10 0
11 1
12 2
13 3
14 2
15 0
16 1
17 2
18 4
19 4
20 2
21 0
22 1
23 2
24 5
25 6
26 5
27 2
28 0
29 1
30 2
31 6
32 8
33 9
34 6
35 2
36 0
37 1
38 2
39 7
40 10
41 14
42 12
43 7
44 2
45 0
46 1
47 2
48 8
49 12
50 20
51 20
52 16
53 8
54 2
55 0
56 1
57 2
58 9
59 14
60 27
61 30
62 30
63 20
64 9
65 2
66 0
67 1
68 2
69 10
70 16
71 35
72 42
73 50
74 40
75 25
76 10
77 2
78 0
79 1
80 2
81 11
82 18
83 44
84 56
85 77
86 70
87 55
88 30
89 11
90 2

List of values

[1, 0, 2, 0, 1, 2, 0, 1, 2, 2, 0, 1, 2, 3, 2, 0, 1, 2, 4, 4, 2, 0, 1, 2, 5, 6, 5, 2, 0, 1, 2, 6, 8, 9, 6, 2, 0, 1, 2, 7, 10, 14, 12, 7, 2, 0, 1, 2, 8, 12, 20, 20, 16, 8, 2, 0, 1, 2, 9, 14, 27, 30, 30, 20, 9, 2, 0, 1, 2, 10, 16, 35, 42, 50, 40, 25, 10, 2, 0, 1, 2, 11, 18, 44, 56, 77, 70, 55, 30, 11, 2]