A326033 - cp's OEIS frontend

A326033 Number of knapsack partitions of n such that no addition of one part equal to an existing part is knapsack.

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

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 1, 1, 0, 3, 0, 0, 1, 1, 0, 8, 0, 8, 4, 3, 0, 11, 5, 3, 4, 5, 0, 30, 2, 9, 9, 20, 3, 37, 6, 18, 16, 37, 20, 71, 12, 37, 40]

cp's OEIS Frontend

A326033 Number of knapsack partitions of n such that no addition of one part equal to an existing part is knapsack.

Table of values

List of values

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

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

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