A364891 - cp's OEIS frontend

A364891 Triangle read by rows: T(n,k) = (-1)^(k-1)Sum_{j=0..k-1} (-1)^j(p(n - j(2j + 1)) - p(n - (j + 1)(2j + 1))), where p(n) = A000041(n) is the number of partitions of n, and 1 <= k <= n.

n	a(n)
1	0
2	1
3	-1
4	1
5	0
6	0
7	2
8	-1
9	1
10	-1
11	2
12	0
13	0
14	0
15	0
16	4
17	-2
18	2
19	-2
20	2
21	-2
22	4
23	0
24	0
25	0
26	0
27	0
28	0
29	7
30	-2
31	2
32	-2
33	2
34	-2
35	2
36	-2
37	8
38	0
39	0
40	0
41	0
42	0
43	0
44	0
45	0
46	12
47	-2
48	3
49	-3
50	3
51	-3
52	3
53	-3
54	3
55	-3
56	14
57	1
58	0
59	0
60	0
61	0
62	0
63	0
64	0
65	0
66	0
67	21
68	-2
69	4
70	-4
71	4
72	-4
73	4
74	-4
75	4
76	-4
77	4
78	-4

[0, 1, -1, 1, 0, 0, 2, -1, 1, -1, 2, 0, 0, 0, 0, 4, -2, 2, -2, 2, -2, 4, 0, 0, 0, 0, 0, 0, 7, -2, 2, -2, 2, -2, 2, -2, 8, 0, 0, 0, 0, 0, 0, 0, 0, 12, -2, 3, -3, 3, -3, 3, -3, 3, -3, 14, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, -2, 4, -4, 4, -4, 4, -4, 4, -4, 4, -4]

cp's OEIS Frontend

A364891 Triangle read by rows: T(n,k) = (-1)^(k-1)Sum_{j=0..k-1} (-1)^j(p(n - j(2j + 1)) - p(n - (j + 1)(2j + 1))), where p(n) = A000041(n) is the number of partitions of n, and 1 <= k <= n.

Table of values

List of values

n	a(n)
1	0
2	1
3	-1
4	1
5	0
6	0
7	2
8	-1
9	1
10	-1
11	2
12	0
13	0
14	0
15	0
16	4
17	-2
18	2
19	-2
20	2
21	-2
22	4
23	0
24	0
25	0
26	0
27	0
28	0
29	7
30	-2
31	2
32	-2
33	2
34	-2
35	2
36	-2
37	8
38	0
39	0
40	0
41	0
42	0
43	0
44	0
45	0
46	12
47	-2
48	3
49	-3
50	3
51	-3
52	3
53	-3
54	3
55	-3
56	14
57	1
58	0
59	0
60	0
61	0
62	0
63	0
64	0
65	0
66	0
67	21
68	-2
69	4
70	-4
71	4
72	-4
73	4
74	-4
75	4
76	-4
77	4
78	-4

n	a(n)
1	0
2	1
3	-1
4	1
5	0
6	0
7	2
8	-1
9	1
10	-1
11	2
12	0
13	0
14	0
15	0
16	4
17	-2
18	2
19	-2
20	2
21	-2
22	4
23	0
24	0
25	0
26	0
27	0
28	0
29	7
30	-2
31	2
32	-2
33	2
34	-2
35	2
36	-2
37	8
38	0
39	0
40	0
41	0
42	0
43	0
44	0
45	0
46	12
47	-2
48	3
49	-3
50	3
51	-3
52	3
53	-3
54	3
55	-3
56	14
57	1
58	0
59	0
60	0
61	0
62	0
63	0
64	0
65	0
66	0
67	21
68	-2
69	4
70	-4
71	4
72	-4
73	4
74	-4
75	4
76	-4
77	4
78	-4

cp's OEIS Frontend

A364891 Triangle read by rows: T(n,k) = (-1)^(k-1)*Sum_{j=0..k-1} (-1)^j*(p(n - j*(2*j + 1)) - p(n - (j + 1)*(2*j + 1))), where p(n) = A000041(n) is the number of partitions of n, and 1 <= k <= n.

Table of values

List of values

A364891 Triangle read by rows: T(n,k) = (-1)^(k-1)Sum_{j=0..k-1} (-1)^j(p(n - j(2j + 1)) - p(n - (j + 1)(2j + 1))), where p(n) = A000041(n) is the number of partitions of n, and 1 <= k <= n.

n	a(n)
1	0
2	1
3	-1
4	1
5	0
6	0
7	2
8	-1
9	1
10	-1
11	2
12	0
13	0
14	0
15	0
16	4
17	-2
18	2
19	-2
20	2
21	-2
22	4
23	0
24	0
25	0
26	0
27	0
28	0
29	7
30	-2
31	2
32	-2
33	2
34	-2
35	2
36	-2
37	8
38	0
39	0
40	0
41	0
42	0
43	0
44	0
45	0
46	12
47	-2
48	3
49	-3
50	3
51	-3
52	3
53	-3
54	3
55	-3
56	14
57	1
58	0
59	0
60	0
61	0
62	0
63	0
64	0
65	0
66	0
67	21
68	-2
69	4
70	-4
71	4
72	-4
73	4
74	-4
75	4
76	-4
77	4
78	-4