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.

A125718 a(1)=1. a(n) = the smallest positive integer not occurring earlier in the sequence such that the n-th prime is congruent to a(n) (mod n).

Table of values

n a(n)
1 1
2 3
3 2
4 7
5 6
6 13
7 10
8 11
9 5
10 9
11 20
12 25
13 15
14 29
15 17
16 21
17 8
18 43
19 48
20 31
21 52
22 35
23 14
24 41
25 22
26 23
27 49
28 51
29 80
30 53
31 34
32 67
33 38
34 37
35 44
36 79
37 46
38 87
39 50
40 93
41 56
42 55
43 19
44 61
45 62
46 107
47 70
48 127
49 129
50 179
51 131
52 83
53 82
54 89
55 92
56 39
57 98
58 97
59 100
60 101
61 161
62 45
63 118
64 119
65 183
66 185
67 63
68 65

List of values

[1, 3, 2, 7, 6, 13, 10, 11, 5, 9, 20, 25, 15, 29, 17, 21, 8, 43, 48, 31, 52, 35, 14, 41, 22, 23, 49, 51, 80, 53, 34, 67, 38, 37, 44, 79, 46, 87, 50, 93, 56, 55, 19, 61, 62, 107, 70, 127, 129, 179, 131, 83, 82, 89, 92, 39, 98, 97, 100, 101, 161, 45, 118, 119, 183, 185, 63, 65]