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.

A302828 Array read by antidiagonals: T(n,k) = number of noncrossing path sets on k*n nodes up to rotation and reflection 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 2
12 4
13 2
14 1
15 1
16 3
17 21
18 22
19 3
20 1
21 1
22 6
23 111
24 494
25 201
26 6
27 1
28 1
29 10
30 604
31 9400
32 18086
33 2244
34 12
35 1
36 1
37 20
38 3196
39 157040
40 1141055
41 794696
42 29096
43 27
44 1
45 1
46 36
47 16528
48 2342480
49 55967596
50 161927208
51 38695548
52 404064
53 65
54 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 2, 1, 1, 3, 21, 22, 3, 1, 1, 6, 111, 494, 201, 6, 1, 1, 10, 604, 9400, 18086, 2244, 12, 1, 1, 20, 3196, 157040, 1141055, 794696, 29096, 27, 1, 1, 36, 16528, 2342480, 55967596, 161927208, 38695548, 404064, 65, 1]