A261062 - cp's OEIS frontend

A261062 Number of solutions to c(1)prime(2) + ... + c(2n-1)prime(2n) = -1, where c(i) = +-1 for i > 1, c(1) = 1.

n	a(n)
1	0
2	0
3	1
4	0
5	6
6	8
7	30
8	121
9	385
10	1102
11	4207
12	13263
13	48904
14	164298
15	610450
16	2108897
17	7592564
18	27444148
19	100851443
20	365507140
21	1344593522
22	4960584613
23	18435632285
24	68320148701
25	254166868115
26	951593812462
27	3568369245595
28	13386056545363
29	50416752718382

[0, 0, 1, 0, 6, 8, 30, 121, 385, 1102, 4207, 13263, 48904, 164298, 610450, 2108897, 7592564, 27444148, 100851443, 365507140, 1344593522, 4960584613, 18435632285, 68320148701, 254166868115, 951593812462, 3568369245595, 13386056545363, 50416752718382]

cp's OEIS Frontend

A261062 Number of solutions to c(1)prime(2) + ... + c(2n-1)prime(2n) = -1, where c(i) = +-1 for i > 1, c(1) = 1.

Table of values

List of values

cp's OEIS Frontend

A261062 Number of solutions to c(1)*prime(2) + ... + c(2n-1)*prime(2n) = -1, where c(i) = +-1 for i > 1, c(1) = 1.

Table of values

List of values

A261062 Number of solutions to c(1)prime(2) + ... + c(2n-1)prime(2n) = -1, where c(i) = +-1 for i > 1, c(1) = 1.