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.

A186102 Smallest prime p such that p == n (mod prime(n)).

Table of values

n a(n)
1 3
2 2
3 3
4 11
5 5
6 19
7 7
8 103
9 101
10 97
11 11
12 197
13 13
14 229
15 109
16 281
17 17
18 79
19 19
20 233
21 167
22 101
23 23
24 113
25 607
26 127
27 233
28 349
29 29
30 821
31 31
32 163
33 307
34 173
35 631
36 1093
37 37
38 853
39 373
40 1597
41 41
42 223
43 43
44 1009
45 439
46 643
47 47
48 271
49 503
50 2111
51 983
52 769
53 53
54 1811
55 569
56 2423

List of values

[3, 2, 3, 11, 5, 19, 7, 103, 101, 97, 11, 197, 13, 229, 109, 281, 17, 79, 19, 233, 167, 101, 23, 113, 607, 127, 233, 349, 29, 821, 31, 163, 307, 173, 631, 1093, 37, 853, 373, 1597, 41, 223, 43, 1009, 439, 643, 47, 271, 503, 2111, 983, 769, 53, 1811, 569, 2423]