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.

A232548 Number of ways to write n = p - pi(p) + 2^k + 2^m with 0 < k <= m, where p is an odd prime and pi(p) is the number of primes not exceeding p.

Table of values

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

List of values

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