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.

A333615 a(n) is the number of ways to express 2*n+1 as a sum of parts x such that x+2 is an odd prime.

Table of values

n a(n)
0 1
1 2
2 3
3 4
4 7
5 10
6 13
7 20
8 26
9 34
10 48
11 61
12 78
13 103
14 129
15 162
16 206
17 256
18 314
19 391
20 479
21 579
22 711
23 859
24 1028
25 1243
26 1485
27 1764
28 2107
29 2497
30 2941
31 3477
32 4092
33 4783
34 5610
35 6557
36 7615
37 8872
38 10303
39 11901
40 13781
41 15910
42 18292
43 21062
44 24196
45 27697
46 31726
47 36287

List of values

[1, 2, 3, 4, 7, 10, 13, 20, 26, 34, 48, 61, 78, 103, 129, 162, 206, 256, 314, 391, 479, 579, 711, 859, 1028, 1243, 1485, 1764, 2107, 2497, 2941, 3477, 4092, 4783, 5610, 6557, 7615, 8872, 10303, 11901, 13781, 15910, 18292, 21062, 24196, 27697, 31726, 36287]