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.

A262980 Number of ordered ways to write n as p + 2^k + pi(2^m), where p is prime, and k and m are nonnegative integers, and pi(x) denotes the number of primes not exceeding x.

Table of values

n a(n)
1 0
2 0
3 1
4 3
5 4
6 5
7 6
8 7
9 7
10 8
11 8
12 7
13 9
14 7
15 12
16 7
17 10
18 7
19 12
20 9
21 14
22 11
23 12
24 10
25 15
26 8
27 13
28 6
29 12
30 7
31 12
32 9
33 13
34 9
35 14
36 11
37 15
38 11
39 18
40 9
41 14
42 8
43 14
44 10
45 18
46 13
47 11
48 9
49 18
50 13
51 17
52 10
53 13
54 7
55 15
56 12
57 14
58 10
59 10
60 10
61 15
62 12
63 19
64 11
65 15
66 12
67 16
68 10
69 20
70 12
71 13
72 12
73 20
74 12
75 23

List of values

[0, 0, 1, 3, 4, 5, 6, 7, 7, 8, 8, 7, 9, 7, 12, 7, 10, 7, 12, 9, 14, 11, 12, 10, 15, 8, 13, 6, 12, 7, 12, 9, 13, 9, 14, 11, 15, 11, 18, 9, 14, 8, 14, 10, 18, 13, 11, 9, 18, 13, 17, 10, 13, 7, 15, 12, 14, 10, 10, 10, 15, 12, 19, 11, 15, 12, 16, 10, 20, 12, 13, 12, 20, 12, 23]