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.

A370942 Irregular triangle read by rows: T(n,k) is the number of nonempty, longest nonoverlapping properly nested substrings into which the k-th string of parentheses of length n can be split into, where strings within a row are in reverse lexicographical order.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 2, 1, 1]