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.

A127284 a(n) = number of valleys (DU-steps) in the Dyck path encoded by A014486(n).

Table of values

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

List of values

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