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.

A085358 Runs of zeros in binomial(3k,k)/(2k+1) (Mod 2): relates ternary trees (A001764) to the infinite Fibonacci word (A003849).

Table of values

n a(n)
0 1
1 2
2 5
3 1
4 10
5 1
6 2
7 21
8 1
9 2
10 5
11 1
12 42
13 1
14 2
15 5
16 1
17 10
18 1
19 2
20 85
21 1
22 2
23 5
24 1
25 10
26 1
27 2
28 21
29 1
30 2
31 5
32 1
33 170
34 1
35 2
36 5
37 1
38 10
39 1
40 2
41 21
42 1
43 2
44 5
45 1
46 42
47 1
48 2
49 5
50 1
51 10
52 1
53 2
54 341
55 1
56 2
57 5
58 1
59 10
60 1
61 2
62 21
63 1
64 2
65 5
66 1
67 42
68 1
69 2
70 5
71 1
72 10
73 1
74 2
75 85
76 1
77 2
78 5
79 1
80 10
81 1
82 2
83 21
84 1
85 2
86 5
87 1
88 682
89 1
90 2
91 5
92 1

List of values

[1, 2, 5, 1, 10, 1, 2, 21, 1, 2, 5, 1, 42, 1, 2, 5, 1, 10, 1, 2, 85, 1, 2, 5, 1, 10, 1, 2, 21, 1, 2, 5, 1, 170, 1, 2, 5, 1, 10, 1, 2, 21, 1, 2, 5, 1, 42, 1, 2, 5, 1, 10, 1, 2, 341, 1, 2, 5, 1, 10, 1, 2, 21, 1, 2, 5, 1, 42, 1, 2, 5, 1, 10, 1, 2, 85, 1, 2, 5, 1, 10, 1, 2, 21, 1, 2, 5, 1, 682, 1, 2, 5, 1]