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.

A303864 Array read by antidiagonals: T(n,k) = number of noncrossing path sets on k*n nodes up to rotation with each path having exactly k nodes.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 3
12 6
13 2
14 1
15 1
16 4
17 36
18 38
19 3
20 1
21 1
22 10
23 210
24 960
25 384
26 6
27 1
28 1
29 16
30 1176
31 18680
32 35956
33 4425
34 14
35 1
36 1
37 36
38 6328
39 313664
40 2280910
41 1588192
42 57976
43 34
44 1
45 1
46 64
47 32896
48 4683168
49 111925464
50 323840016
51 77381016
52 807318
53 95
54 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 6, 2, 1, 1, 4, 36, 38, 3, 1, 1, 10, 210, 960, 384, 6, 1, 1, 16, 1176, 18680, 35956, 4425, 14, 1, 1, 36, 6328, 313664, 2280910, 1588192, 57976, 34, 1, 1, 64, 32896, 4683168, 111925464, 323840016, 77381016, 807318, 95, 1]