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.

A350248 Triangle read by rows: T(n,k) is the number of noncrossing partitions of an n-set into k blocks of size 3 or more, n >= 0, 0 <= k <= floor(n/3).

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 0
6 1
7 0
8 1
9 0
10 1
11 3
12 0
13 1
14 7
15 0
16 1
17 12
18 0
19 1
20 18
21 12
22 0
23 1
24 25
25 45
26 0
27 1
28 33
29 110
30 0
31 1
32 42
33 220
34 55
35 0
36 1
37 52
38 390
39 286
40 0
41 1
42 63
43 637
44 910
45 0
46 1
47 75
48 980
49 2275
50 273
51 0
52 1
53 88
54 1440
55 4900
56 1820
57 0
58 1
59 102
60 2040
61 9520
62 7140
63 0
64 1
65 117
66 2805
67 17136
68 21420
69 1428

List of values

[1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 3, 0, 1, 7, 0, 1, 12, 0, 1, 18, 12, 0, 1, 25, 45, 0, 1, 33, 110, 0, 1, 42, 220, 55, 0, 1, 52, 390, 286, 0, 1, 63, 637, 910, 0, 1, 75, 980, 2275, 273, 0, 1, 88, 1440, 4900, 1820, 0, 1, 102, 2040, 9520, 7140, 0, 1, 117, 2805, 17136, 21420, 1428]