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.

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

Table of values

n a(n)
0 1
1 2
2 2
3 1
4 2
5 3
6 2
7 5
8 1
9 2
10 7
11 4
12 2
13 9
14 9
15 1
16 2
17 11
18 16
19 5
20 2
21 13
22 25
23 14
24 1
25 2
26 15
27 36
28 30
29 6
30 2
31 17
32 49
33 55
34 20
35 1
36 2
37 19
38 64
39 91
40 50
41 7
42 2
43 21
44 81
45 140
46 105
47 27
48 1
49 2
50 23
51 100
52 204
53 196
54 77
55 8
56 2
57 25
58 121
59 285
60 336
61 182
62 35
63 1
64 2
65 27
66 144
67 385
68 540
69 378
70 112
71 9
72 2
73 29
74 169
75 506

List of values

[1, 2, 2, 1, 2, 3, 2, 5, 1, 2, 7, 4, 2, 9, 9, 1, 2, 11, 16, 5, 2, 13, 25, 14, 1, 2, 15, 36, 30, 6, 2, 17, 49, 55, 20, 1, 2, 19, 64, 91, 50, 7, 2, 21, 81, 140, 105, 27, 1, 2, 23, 100, 204, 196, 77, 8, 2, 25, 121, 285, 336, 182, 35, 1, 2, 27, 144, 385, 540, 378, 112, 9, 2, 29, 169, 506]