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.

A219109 The smallest k such that prime(k) == -1 (mod n).

Table of values

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

List of values

[1, 2, 1, 2, 8, 3, 6, 4, 7, 8, 14, 5, 27, 6, 10, 11, 19, 7, 12, 8, 13, 14, 33, 9, 35, 27, 16, 23, 40, 10, 18, 11, 32, 19, 34, 20, 21, 12, 51, 22, 38, 13, 55, 14, 24, 33, 60, 15, 25, 35, 26, 27, 47, 16, 29, 39, 30, 40, 71, 17, 93, 18, 54, 31, 77, 32, 79, 19, 33, 34, 61, 20, 172, 21, 35, 36]