A261057 - cp's OEIS frontend

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

n	a(n)
1	0
2	0
3	1
4	1
5	5
6	13
7	40
8	123
9	388
10	1284
11	4332
12	14868
13	51094
14	178361
15	634422
16	2260717
17	8066841
18	29030051
19	105247340
20	383574146
21	1404657053
22	5171018981
23	19140750300
24	71124341227
25	263546155710
26	983417309702
27	3684399940711
28	13818092760075
29	51937827473594
30	195956606402526

[0, 0, 1, 1, 5, 13, 40, 123, 388, 1284, 4332, 14868, 51094, 178361, 634422, 2260717, 8066841, 29030051, 105247340, 383574146, 1404657053, 5171018981, 19140750300, 71124341227, 263546155710, 983417309702, 3684399940711, 13818092760075, 51937827473594, 195956606402526]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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