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.

A130138 Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 1011'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 9
7 4
8 11
9 10
10 13
11 20
12 1
13 15
14 35
15 5
16 17
17 56
18 16
19 19
20 84
21 40
22 1
23 21
24 120
25 86
26 6
27 23
28 165
29 166
30 23
31 25
32 220
33 296
34 68
35 1
36 27
37 286
38 496
39 171
40 7
41 29
42 364
43 791
44 382
45 31
46 31
47 455
48 1211
49 781
50 105
51 1
52 33
53 560
54 1792
55 1488
56 300
57 8
58 35
59 680
60 2576
61 2678
62 756
63 40
64 37

List of values

[1, 2, 3, 5, 7, 1, 9, 4, 11, 10, 13, 20, 1, 15, 35, 5, 17, 56, 16, 19, 84, 40, 1, 21, 120, 86, 6, 23, 165, 166, 23, 25, 220, 296, 68, 1, 27, 286, 496, 171, 7, 29, 364, 791, 382, 31, 31, 455, 1211, 781, 105, 1, 33, 560, 1792, 1488, 300, 8, 35, 680, 2576, 2678, 756, 40, 37]