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.

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

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 6, 6, 9, 8, 8, 11, 11, 10, 13, 13, 12, 14, 15, 13, 18, 17, 14, 21, 19, 17, 25, 20, 21, 26, 25, 22, 30, 28, 21, 32, 31, 23, 37, 32, 27, 39, 36, 32, 43, 41, 36, 45, 44, 35, 51, 48, 34, 54, 48, 36, 59, 50, 43, 60, 55, 46, 61]