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.

A115230 Let p = prime(n); a(n) = number of ways to write p = 2^i + q^j where i >= 0, j >= 1, q = odd prime.

Table of values

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

List of values

[1, 1, 2, 2, 3, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 2, 2, 3, 2, 2, 3, 2, 4, 3, 2, 2, 2, 2, 2, 4, 1, 3, 3, 4, 0, 2, 3, 1, 3, 3, 1, 4, 1, 1, 2, 4, 2, 1, 3, 3, 2, 1, 3, 1, 3, 2, 1, 3, 2, 2, 3, 4, 2, 1, 2, 2, 0, 1, 3, 2, 4, 2, 2, 0, 2, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 3, 0, 2, 3, 2, 1, 1, 3, 1, 4]