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.

A360334 Array read by antidiagonals downwards: A(n,m) = number of set partitions of [3n] into 3-element subsets {i, i+k, i+2k} 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 2
9 3
10 1
11 1
12 2
13 4
14 5
15 1
16 1
17 2
18 5
19 7
20 8
21 1
22 1
23 2
24 5
25 12
26 13
27 13
28 1
29 1
30 2
31 5
32 15
33 25
34 24
35 21
36 1
37 1
38 2
39 5
40 15
41 35
42 56
43 44
44 34
45 1
46 1
47 2
48 5
49 15
50 46
51 84
52 126
53 81
54 55
55 1
56 1
57 2
58 5
59 15
60 55
61 129
62 211
63 281
64 149
65 89
66 1
67 1
68 2
69 5
70 15
71 55
72 185
73 346
74 537
75 625
76 274
77 144
78 1

List of values

[1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 5, 1, 1, 2, 5, 7, 8, 1, 1, 2, 5, 12, 13, 13, 1, 1, 2, 5, 15, 25, 24, 21, 1, 1, 2, 5, 15, 35, 56, 44, 34, 1, 1, 2, 5, 15, 46, 84, 126, 81, 55, 1, 1, 2, 5, 15, 55, 129, 211, 281, 149, 89, 1, 1, 2, 5, 15, 55, 185, 346, 537, 625, 274, 144, 1]