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.

A174847 Number m of ways of representing 2n+1 as a sum of three primes such that all 3m primes are distinct.

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 1
11 1
12 1
13 1
14 2
15 2
16 2
17 2
18 2
19 2
20 2
21 2
22 1
23 2
24 3
25 3
26 3
27 3
28 2
29 3
30 3
31 3
32 3
33 3
34 3
35 4
36 4
37 4
38 3
39 3
40 3
41 4
42 4
43 4
44 4
45 5
46 4
47 4
48 4
49 4
50 5
51 4
52 5
53 5
54 5
55 5
56 5
57 4
58 5
59 6
60 5
61 6
62 6
63 6
64 6
65 6
66 6
67 6
68 7
69 6
70 6
71 6
72 6
73 7
74 6
75 7
76 7
77 7
78 7
79 7
80 7
81 6
82 7
83 8
84 7
85 7
86 7
87 7
88 8
89 8
90 7
91 8
92 8
93 8
94 9
95 8
96 8
97 9
98 8
99 8
100 8
101 8
102 9
103 9
104 8
105 9
106 9
107 9
108 8
109 9
110 9
111 9
112 9
113 10

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 3, 3, 3, 4, 4, 4, 4, 5, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 5, 4, 5, 6, 5, 6, 6, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 7, 6, 7, 7, 7, 7, 7, 7, 6, 7, 8, 7, 7, 7, 7, 8, 8, 7, 8, 8, 8, 9, 8, 8, 9, 8, 8, 8, 8, 9, 9, 8, 9, 9, 9, 8, 9, 9, 9, 9, 10]