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.

A059871 Number of solutions to the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 +- 1, where p_i is the i-th prime number (where p_1 = 2 and the "zeroth prime" p_0 is defined to be 1).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 3
7 3
8 4
9 6
10 12
11 16
12 31
13 46
14 90
15 140
16 276
17 449
18 877
19 1443
20 2834
21 4725
22 9395
23 16153
24 32037
25 55872
26 110288
27 190815
28 380488
29 672728
30 1342395
31 2434797
32 4808180
33 8579625
34 17070112
35 30858078
36 61271317
37 110926277
38 220979544
39 402354848

List of values

[1, 1, 1, 1, 1, 3, 3, 4, 6, 12, 16, 31, 46, 90, 140, 276, 449, 877, 1443, 2834, 4725, 9395, 16153, 32037, 55872, 110288, 190815, 380488, 672728, 1342395, 2434797, 4808180, 8579625, 17070112, 30858078, 61271317, 110926277, 220979544, 402354848]