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.

A129717 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 101's (n >= 0, 0 <= k <= floor((n-1)/2)). 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 4
6 4
7 4
8 8
9 1
10 4
11 12
12 5
13 4
14 16
15 13
16 1
17 4
18 20
19 25
20 6
21 4
22 24
23 41
24 19
25 1
26 4
27 28
28 61
29 44
30 7
31 4
32 32
33 85
34 85
35 26
36 1
37 4
38 36
39 113
40 146
41 70
42 8
43 4
44 40
45 145
46 231
47 155
48 34
49 1
50 4
51 44
52 181
53 344
54 301
55 104
56 9
57 4
58 48
59 221
60 489
61 532
62 259
63 43
64 1
65 4
66 52
67 265
68 670
69 876
70 560
71 147
72 10
73 4
74 56

List of values

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