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.

A117054 Number of ordered ways of writing n = i + j, where i is a prime and j is of the form k*(k+1), k > 0.

Table of values

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

List of values

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