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.

A129719 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 0's in odd positions (0 <= k <= ceiling(n/2)). A Fibonacci binary word is a binary word having no 00 subword.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 1
5 2
6 2
7 1
8 4
9 3
10 1
11 4
12 5
13 3
14 1
15 8
16 8
17 4
18 1
19 8
20 12
21 9
22 4
23 1
24 16
25 20
26 13
27 5
28 1
29 16
30 28
31 25
32 14
33 5
34 1
35 32
36 48
37 38
38 19
39 6
40 1
41 32
42 64
43 66
44 44
45 20
46 6
47 1
48 64
49 112
50 104
51 63
52 26
53 7
54 1
55 64
56 144
57 168
58 129
59 70
60 27
61 7
62 1
63 128
64 256
65 272
66 192
67 96
68 34
69 8
70 1
71 128
72 320
73 416
74 360
75 225
76 104
77 35

List of values

[1, 1, 1, 2, 1, 2, 2, 1, 4, 3, 1, 4, 5, 3, 1, 8, 8, 4, 1, 8, 12, 9, 4, 1, 16, 20, 13, 5, 1, 16, 28, 25, 14, 5, 1, 32, 48, 38, 19, 6, 1, 32, 64, 66, 44, 20, 6, 1, 64, 112, 104, 63, 26, 7, 1, 64, 144, 168, 129, 70, 27, 7, 1, 128, 256, 272, 192, 96, 34, 8, 1, 128, 320, 416, 360, 225, 104, 35]