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.

A086508 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 7
4 3
5 11
6 5
7 29
8 7
9 19
10 19
11 23
12 11
13 53
14 13
15 31
16 31
17 103
18 17
19 191
20 19
21 43
22 43
23 47
24 23
25 101
26 103
27 109
28 83
29 59
30 29
31 311
32 31
33 67
34 67
35 71
36 71
37 149
38 37
39 79
40 79
41 83
42 41
43 173
44 43
45 181
46 137
47 283
48 47
49 197
50 149
51 103
52 103
53 107
54 53
55 331
56 167
57 229
58 173
59 709
60 59
61 367
62 61
63 127

List of values

[2, 3, 7, 3, 11, 5, 29, 7, 19, 19, 23, 11, 53, 13, 31, 31, 103, 17, 191, 19, 43, 43, 47, 23, 101, 103, 109, 83, 59, 29, 311, 31, 67, 67, 71, 71, 149, 37, 79, 79, 83, 41, 173, 43, 181, 137, 283, 47, 197, 149, 103, 103, 107, 53, 331, 167, 229, 173, 709, 59, 367, 61, 127]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.