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.

A083747 Smallest number m >= 0 such that n followed by m ones yields a prime; a(p) = -1 if no such m exists.

Table of values

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

List of values

[1, 0, 0, 1, 0, 1, 0, 2, 2, 1, 0, 136, 0, 9, 1, 3, 0, 1, 0, 2, 1, 3, 0, 1, 1, 3, 1, 1, 0, 2, 0, 35, 1, 6, 2, 4, 0, -1, 2, 1, 0, 1, 0, 3, 772, 1, 0, 5, 1, 2, 4, 1, 0, 1, 31, 18470, 1, 3, 0, 1, 0, 2, 1, 1, 3, 1, 0, 3, 1, 1, 0, 2, 0, 2, 1, 1, 9, 4, 0, 2, 1, 1, 0, 5, 6, 3, 149, 1, 0, 2, 1, 3, 2, 1, 2, 7, 0, 2, 1, 10, 0, 1, 0, 44, 1, 1, 0, 5, 0, 17, 16, 3, 0, 2, 1, 9, 1, 1, 5, 1]