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.

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

Table of values

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

List of values

[1, 2, 1, 1, 2, 1, -1, 2, 1, 1, 3, 1, 1, -1, 1, 1, 2, 2, 1, 6, -1, 1, 2, 2, 1, 2, 1, -1, 48, 1, 1, 5, 1, 1, -1, 1, 10, 2, 1, 12, 2, -1, 3, 3, 1, 1, 3, 1, -1, 2, 8, 7, 3, 1, 1, -1, 1, 1, 9, 1, 1, 2, -1, 1, 2, 5, 1, 3, 2, -1, 2, 1, 66, 2, 1, 3, -1, 1, 1, 3]