A213086 - cp's OEIS frontend

A213086 Square array read by antidiagonals: T(n,m) (n>=1, m>=0) is the number of partitions of mn that are the sum of m not necessarily distinct partitions of n.

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	5
13	6
14	4
15	1
16	1
17	7
18	14
19	10
20	5
21	1
22	1
23	11
24	25
25	30
26	15
27	6
28	1
29	1
30	15
31	53
32	65
33	55
34	21
35	7
36	1
37	1
38	22
39	89
40	173
41	140
42	91
43	28
44	8
45	1
46	1
47	30
48	167
49	343
50	448
51	266
52	140
53	36
54	9
55	1
56	1
57	42
58	278
59	778
60	1022
61	994
62	462
63	204
64	45
65	10
66	1
67	1
68	56
69	480
70	1518
71	2710
72	2562
73	1974
74	750
75	285
76	55
77	11
78	1

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 6, 4, 1, 1, 7, 14, 10, 5, 1, 1, 11, 25, 30, 15, 6, 1, 1, 15, 53, 65, 55, 21, 7, 1, 1, 22, 89, 173, 140, 91, 28, 8, 1, 1, 30, 167, 343, 448, 266, 140, 36, 9, 1, 1, 42, 278, 778, 1022, 994, 462, 204, 45, 10, 1, 1, 56, 480, 1518, 2710, 2562, 1974, 750, 285, 55, 11, 1]

cp's OEIS Frontend

A213086 Square array read by antidiagonals: T(n,m) (n>=1, m>=0) is the number of partitions of mn that are the sum of m not necessarily distinct partitions of n.

Table of values

List of values