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.

A129721 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 0's in even positions (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 4
5 1
6 4
7 3
8 1
9 8
10 4
11 1
12 8
13 8
14 4
15 1
16 16
17 12
18 5
19 1
20 16
21 20
22 13
23 5
24 1
25 32
26 32
27 18
28 6
29 1
30 32
31 48
32 38
33 19
34 6
35 1
36 64
37 80
38 56
39 25
40 7
41 1
42 64
43 112
44 104
45 63
46 26
47 7
48 1
49 128
50 192
51 160
52 88
53 33
54 8
55 1
56 128
57 256
58 272
59 192
60 96
61 34
62 8
63 1
64 256
65 448
66 432
67 280
68 129
69 42
70 9
71 1
72 256
73 576
74 688
75 552

List of values

[1, 2, 2, 1, 4, 1, 4, 3, 1, 8, 4, 1, 8, 8, 4, 1, 16, 12, 5, 1, 16, 20, 13, 5, 1, 32, 32, 18, 6, 1, 32, 48, 38, 19, 6, 1, 64, 80, 56, 25, 7, 1, 64, 112, 104, 63, 26, 7, 1, 128, 192, 160, 88, 33, 8, 1, 128, 256, 272, 192, 96, 34, 8, 1, 256, 448, 432, 280, 129, 42, 9, 1, 256, 576, 688, 552]