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.

A349740 Number of partitions of set [n] in a set of <= k noncrossing subsets. Number of Dyck n-paths with at most k peaks. Both with 0 <= k <= n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 2
6 0
7 1
8 4
9 5
10 0
11 1
12 7
13 13
14 14
15 0
16 1
17 11
18 31
19 41
20 42
21 0
22 1
23 16
24 66
25 116
26 131
27 132
28 0
29 1
30 22
31 127
32 302
33 407
34 428
35 429
36 0
37 1
38 29
39 225
40 715
41 1205
42 1401
43 1429
44 1430
45 0
46 1
47 37
48 373
49 1549
50 3313
51 4489
52 4825
53 4861
54 4862
55 0
56 1
57 46
58 586
59 3106
60 8398
61 13690
62 16210
63 16750
64 16795
65 16796

List of values

[1, 0, 1, 0, 1, 2, 0, 1, 4, 5, 0, 1, 7, 13, 14, 0, 1, 11, 31, 41, 42, 0, 1, 16, 66, 116, 131, 132, 0, 1, 22, 127, 302, 407, 428, 429, 0, 1, 29, 225, 715, 1205, 1401, 1429, 1430, 0, 1, 37, 373, 1549, 3313, 4489, 4825, 4861, 4862, 0, 1, 46, 586, 3106, 8398, 13690, 16210, 16750, 16795, 16796]