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.

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

List of values

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