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.

A303868 Triangle read by rows: T(n,k) = number of noncrossing path sets on n nodes up to rotation and reflection with k paths and isolated vertices allowed.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 3
9 2
10 1
11 3
12 7
13 6
14 2
15 1
16 6
17 20
18 23
19 11
20 3
21 1
22 10
23 50
24 80
25 51
26 17
27 3
28 1
29 20
30 136
31 285
32 252
33 109
34 26
35 4
36 1
37 36
38 346
39 966
40 1119
41 652
42 200
43 36
44 4
45 1
46 72
47 901
48 3188
49 4782
50 3623
51 1502
52 352
53 50
54 5
55 1
56 136
57 2264
58 10133
59 19116
60 18489
61 9949
62 3120
63 570
64 65
65 5
66 1

List of values

[1, 1, 1, 1, 1, 1, 2, 3, 2, 1, 3, 7, 6, 2, 1, 6, 20, 23, 11, 3, 1, 10, 50, 80, 51, 17, 3, 1, 20, 136, 285, 252, 109, 26, 4, 1, 36, 346, 966, 1119, 652, 200, 36, 4, 1, 72, 901, 3188, 4782, 3623, 1502, 352, 50, 5, 1, 136, 2264, 10133, 19116, 18489, 9949, 3120, 570, 65, 5, 1]