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.

A126306 a(n) = number of double-rises (UU-subsequences) in the n-th Dyck path encoded by A014486(n).

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 0, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 1, 2, 2, 2, 3, 1, 2, 1, 1, 2, 2, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 2, 3, 3, 3, 3, 3, 4, 0, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 1, 2, 2, 2, 3, 1, 2, 1, 1, 2, 2, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 2, 3]