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.

A129718 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/2)). A Fibonacci binary word is a binary word having no 00 subword. A run of 1's is a maximal subword of the form 11..1.

Table of values

n a(n)
0 1
1 1
2 1
3 0
4 3
5 0
6 4
7 1
8 0
9 4
10 4
11 0
12 4
13 8
14 1
15 0
16 4
17 12
18 5
19 0
20 4
21 16
22 13
23 1
24 0
25 4
26 20
27 25
28 6
29 0
30 4
31 24
32 41
33 19
34 1
35 0
36 4
37 28
38 61
39 44
40 7
41 0
42 4
43 32
44 85
45 85
46 26
47 1
48 0
49 4
50 36
51 113
52 146
53 70
54 8
55 0
56 4
57 40
58 145
59 231
60 155
61 34
62 1
63 0
64 4
65 44
66 181
67 344
68 301
69 104
70 9
71 0
72 4
73 48
74 221
75 489
76 532
77 259
78 43
79 1

List of values

[1, 1, 1, 0, 3, 0, 4, 1, 0, 4, 4, 0, 4, 8, 1, 0, 4, 12, 5, 0, 4, 16, 13, 1, 0, 4, 20, 25, 6, 0, 4, 24, 41, 19, 1, 0, 4, 28, 61, 44, 7, 0, 4, 32, 85, 85, 26, 1, 0, 4, 36, 113, 146, 70, 8, 0, 4, 40, 145, 231, 155, 34, 1, 0, 4, 44, 181, 344, 301, 104, 9, 0, 4, 48, 221, 489, 532, 259, 43, 1]