cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 0
6 0
7 2
8 0
9 4
10 0
11 14
12 0
13 38
14 0
15 126
16 0
17 394
18 0
19 1290
20 0
21 4344
22 0
23 14846
24 0
25 51068
26 0
27 178436
28 0
29 634568
30 0
31 2261052
32 0
33 8067296
34 0
35 29031484
36 0
37 105251904
38 0
39 383580180
40 0
41 1404666680
42 0
43 5171079172
44 0
45 19141098744
46 0
47 71125205900
48 0
49 263549059326

List of values

[1, 0, 0, 0, 0, 0, 2, 0, 4, 0, 14, 0, 38, 0, 126, 0, 394, 0, 1290, 0, 4344, 0, 14846, 0, 51068, 0, 178436, 0, 634568, 0, 2261052, 0, 8067296, 0, 29031484, 0, 105251904, 0, 383580180, 0, 1404666680, 0, 5171079172, 0, 19141098744, 0, 71125205900, 0, 263549059326]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.