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.

A130136 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 0110's (n>=0, 0<=k<=floor((n-1)/3)). 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 5
4 7
5 1
6 11
7 2
8 16
9 5
10 25
11 8
12 1
13 37
14 16
15 2
16 57
17 26
18 6
19 85
20 48
21 10
22 1
23 130
24 78
25 23
26 2
27 195
28 136
29 39
30 7
31 297
32 220
33 80
34 12
35 1
36 447
37 371
38 136
39 31
40 2
41 679
42 598
43 258
44 54
45 8
46 1024
47 987
48 437
49 121
50 14
51 1
52 1553
53 1584
54 790
55 212
56 40
57 2
58 2345
59 2576
60 1332
61 432
62 71
63 9
64 3553

List of values

[1, 2, 3, 5, 7, 1, 11, 2, 16, 5, 25, 8, 1, 37, 16, 2, 57, 26, 6, 85, 48, 10, 1, 130, 78, 23, 2, 195, 136, 39, 7, 297, 220, 80, 12, 1, 447, 371, 136, 31, 2, 679, 598, 258, 54, 8, 1024, 987, 437, 121, 14, 1, 1553, 1584, 790, 212, 40, 2, 2345, 2576, 1332, 432, 71, 9, 3553]