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.

A118953 Number of ways to write the n-th prime as 2^k + p, where p is prime and p < 2^k.

Table of values

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

List of values

[0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1]