A360333 - cp's OEIS frontend

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

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	4
19	7
20	8
21	1
22	1
23	2
24	4
25	10
26	13
27	13
28	1
29	1
30	2
31	4
32	11
33	19
34	24
35	21
36	1
37	1
38	2
39	4
40	11
41	22
42	41
43	44
44	34
45	1
46	1
47	2
48	4
49	11
50	23
51	48
52	84
53	81
54	55
55	1
56	1
57	2
58	4
59	11
60	23
61	64
62	101
63	180
64	149
65	89
66	1

[1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 5, 1, 1, 2, 4, 7, 8, 1, 1, 2, 4, 10, 13, 13, 1, 1, 2, 4, 11, 19, 24, 21, 1, 1, 2, 4, 11, 22, 41, 44, 34, 1, 1, 2, 4, 11, 23, 48, 84, 81, 55, 1, 1, 2, 4, 11, 23, 64, 101, 180, 149, 89, 1]

cp's OEIS Frontend

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

Table of values

List 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	4
19	7
20	8
21	1
22	1
23	2
24	4
25	10
26	13
27	13
28	1
29	1
30	2
31	4
32	11
33	19
34	24
35	21
36	1
37	1
38	2
39	4
40	11
41	22
42	41
43	44
44	34
45	1
46	1
47	2
48	4
49	11
50	23
51	48
52	84
53	81
54	55
55	1
56	1
57	2
58	4
59	11
60	23
61	64
62	101
63	180
64	149
65	89
66	1

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	4
19	7
20	8
21	1
22	1
23	2
24	4
25	10
26	13
27	13
28	1
29	1
30	2
31	4
32	11
33	19
34	24
35	21
36	1
37	1
38	2
39	4
40	11
41	22
42	41
43	44
44	34
45	1
46	1
47	2
48	4
49	11
50	23
51	48
52	84
53	81
54	55
55	1
56	1
57	2
58	4
59	11
60	23
61	64
62	101
63	180
64	149
65	89
66	1

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	4
19	7
20	8
21	1
22	1
23	2
24	4
25	10
26	13
27	13
28	1
29	1
30	2
31	4
32	11
33	19
34	24
35	21
36	1
37	1
38	2
39	4
40	11
41	22
42	41
43	44
44	34
45	1
46	1
47	2
48	4
49	11
50	23
51	48
52	84
53	81
54	55
55	1
56	1
57	2
58	4
59	11
60	23
61	64
62	101
63	180
64	149
65	89
66	1