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.

A054860 Number of ways of writing 2n+1 as p + q + r where p, q, r are primes with p <= q <= r.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 2
5 2
6 2
7 3
8 4
9 3
10 5
11 5
12 5
13 7
14 7
15 6
16 9
17 8
18 9
19 10
20 11
21 10
22 12
23 13
24 12
25 15
26 16
27 14
28 17
29 16
30 16
31 19
32 21
33 20
34 20
35 22
36 21
37 22
38 28
39 24
40 25
41 29
42 27
43 29
44 33
45 29
46 33
47 35
48 34
49 30
50 38
51 36
52 35
53 43
54 38
55 37
56 47
57 42
58 43
59 50
60 46
61 47
62 53
63 50
64 45
65 57
66 54
67 47
68 62
69 53
70 49
71 65
72 59
73 55
74 68

List of values

[0, 0, 0, 1, 2, 2, 2, 3, 4, 3, 5, 5, 5, 7, 7, 6, 9, 8, 9, 10, 11, 10, 12, 13, 12, 15, 16, 14, 17, 16, 16, 19, 21, 20, 20, 22, 21, 22, 28, 24, 25, 29, 27, 29, 33, 29, 33, 35, 34, 30, 38, 36, 35, 43, 38, 37, 47, 42, 43, 50, 46, 47, 53, 50, 45, 57, 54, 47, 62, 53, 49, 65, 59, 55, 68]