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.

A209287 Minimal m>=0 such that prime(n)+2*m-1 has form 2^k*p, where k>=0 and p is prime.

Table of values

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

List of values

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