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.

A360335 Array read by antidiagonals downwards: A(n,m) = number of set partitions of [2n] into 2-element subsets {i, i+k} with 1 <= k <= m.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 3
9 3
10 1
11 1
12 3
13 7
14 5
15 1
16 1
17 3
18 12
19 16
20 8
21 1
22 1
23 3
24 15
25 35
26 38
27 13
28 1
29 1
30 3
31 15
32 63
33 105
34 89
35 21
36 1
37 1
38 3
39 15
40 90
41 226
42 329
43 209
44 34
45 1
46 1
47 3
48 15
49 105
50 417
51 841
52 1014
53 491
54 55
55 1
56 1
57 3
58 15
59 105
60 645
61 1787
62 3251
63 3116
64 1153
65 89
66 1

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 3, 7, 5, 1, 1, 3, 12, 16, 8, 1, 1, 3, 15, 35, 38, 13, 1, 1, 3, 15, 63, 105, 89, 21, 1, 1, 3, 15, 90, 226, 329, 209, 34, 1, 1, 3, 15, 105, 417, 841, 1014, 491, 55, 1, 1, 3, 15, 105, 645, 1787, 3251, 3116, 1153, 89, 1]