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.

A073325 a(n) = least k > 0 such that prime(k) == n (mod k).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 75
6 9
7 79
8 18
9 17
10 10
11 19
12 20
13 91
14 22
15 23
16 41
17 83
18 24
19 16049
20 43
21 2711
22 94
23 25
24 26
25 95
26 198
27 449
28 452
29 99
30 50
31 451
32 48
33 453
34 1072
35 447
36 54
37 16043
38 55
39 2719
40 56
41 459
42 57
43 101
44 472
45 100371
46 62
47 105
48 102
49 103
50 104
51 467
52 110
53 107
54 65
55 109
56 63
57 115
58 118
59 117

List of values

[1, 2, 3, 4, 75, 9, 79, 18, 17, 10, 19, 20, 91, 22, 23, 41, 83, 24, 16049, 43, 2711, 94, 25, 26, 95, 198, 449, 452, 99, 50, 451, 48, 453, 1072, 447, 54, 16043, 55, 2719, 56, 459, 57, 101, 472, 100371, 62, 105, 102, 103, 104, 467, 110, 107, 65, 109, 63, 115, 118, 117]