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.

A232398 Number of ways to write n = p + (2^k - k) + (2^m - m) with p prime and 0 < k <= m.

Table of values

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

List of values

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