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.

A086507 If n is even, a(n) = smallest prime == 1 (mod n), If n is odd, a(n) = smallest prime == -1 (mod n).

Table of values

n a(n)
1 2
2 3
3 2
4 5
5 19
6 7
7 13
8 17
9 17
10 11
11 43
12 13
13 103
14 29
15 29
16 17
17 67
18 19
19 37
20 41
21 41
22 23
23 137
24 73
25 149
26 53
27 53
28 29
29 173
30 31
31 61
32 97
33 131
34 103
35 139
36 37
37 73
38 191
39 233
40 41
41 163
42 43
43 257
44 89
45 89
46 47
47 281
48 97
49 97
50 101
51 101
52 53
53 211
54 109
55 109
56 113
57 113
58 59
59 353
60 61
61 487
62 311
63 251

List of values

[2, 3, 2, 5, 19, 7, 13, 17, 17, 11, 43, 13, 103, 29, 29, 17, 67, 19, 37, 41, 41, 23, 137, 73, 149, 53, 53, 29, 173, 31, 61, 97, 131, 103, 139, 37, 73, 191, 233, 41, 163, 43, 257, 89, 89, 47, 281, 97, 97, 101, 101, 53, 211, 109, 109, 113, 113, 59, 353, 61, 487, 311, 251]