A304382 - cp's OEIS frontend

A304382 Number of z-trees summing to n. Number of connected strict integer partitions of n with pairwise indivisible parts and clutter density -1.

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	2
11	1
12	1
13	1
14	3
15	2
16	2
17	1
18	3
19	2
20	4
21	3
22	5
23	2
24	5
25	4
26	6
27	3
28	7
29	6
30	8
31	4
32	9
33	8
34	13
35	9
36	15
37	8
38	14
39	12
40	16
41	12
42	20
43	20
44	24
45	15
46	27
47	20
48	33
49	27
50	35

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 3, 2, 4, 3, 5, 2, 5, 4, 6, 3, 7, 6, 8, 4, 9, 8, 13, 9, 15, 8, 14, 12, 16, 12, 20, 20, 24, 15, 27, 20, 33, 27, 35]

cp's OEIS Frontend

A304382 Number of z-trees summing to n. Number of connected strict integer partitions of n with pairwise indivisible parts and clutter density -1.

Table of values

List of values

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	2
11	1
12	1
13	1
14	3
15	2
16	2
17	1
18	3
19	2
20	4
21	3
22	5
23	2
24	5
25	4
26	6
27	3
28	7
29	6
30	8
31	4
32	9
33	8
34	13
35	9
36	15
37	8
38	14
39	12
40	16
41	12
42	20
43	20
44	24
45	15
46	27
47	20
48	33
49	27
50	35

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	2
11	1
12	1
13	1
14	3
15	2
16	2
17	1
18	3
19	2
20	4
21	3
22	5
23	2
24	5
25	4
26	6
27	3
28	7
29	6
30	8
31	4
32	9
33	8
34	13
35	9
36	15
37	8
38	14
39	12
40	16
41	12
42	20
43	20
44	24
45	15
46	27
47	20
48	33
49	27
50	35

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	2
11	1
12	1
13	1
14	3
15	2
16	2
17	1
18	3
19	2
20	4
21	3
22	5
23	2
24	5
25	4
26	6
27	3
28	7
29	6
30	8
31	4
32	9
33	8
34	13
35	9
36	15
37	8
38	14
39	12
40	16
41	12
42	20
43	20
44	24
45	15
46	27
47	20
48	33
49	27
50	35