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.

A372262 a(n) = smallest number m > 0 such that n followed by m 3's yields a prime, or -1 if no such m exists.

Table of values

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

List of values

[1, 1, -1, 1, 1, -1, 1, 1, -1, 1, 1, -1, 14, 2, -1, 1, 1, -1, 1, 3, -1, 1, 1, -1, 8, 1, -1, 1, 1, -1, 1, 4, -1, 2, 1, -1, 1, 1, -1, 483, 2, -1, 1, 1, -1, 1, 2, -1, 2, 1, -1, 1, 2, -1, 3, 1, -1, 6, 1, -1, 1, 5, -1, 1, 1, -1, 1, 1, -1, 5, 3, -1, 1, 1, -1, 3, 1, -1, 2, 4]