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.

A022457 a(n) = prime(2n) mod prime(n).

Table of values

n a(n)
1 1
2 1
3 3
4 5
5 7
6 11
7 9
8 15
9 15
10 13
11 17
12 15
13 19
14 21
15 19
16 25
17 21
18 29
19 29
20 31
21 35
22 35
23 33
24 45
25 35
26 37
27 45
28 49
29 53
30 55
31 39
32 49
33 43
34 59
35 51
36 57
37 59
38 57
39 63
40 63
41 63
42 71
43 61
44 71
45 69
46 81
47 69
48 57
49 67
50 83
51 91
52 91
53 95
54 91
55 87
56 87
57 81
58 99
59 93
60 97
61 107
62 97
63 87
64 97
65 107
66 109
67 95

List of values

[1, 1, 3, 5, 7, 11, 9, 15, 15, 13, 17, 15, 19, 21, 19, 25, 21, 29, 29, 31, 35, 35, 33, 45, 35, 37, 45, 49, 53, 55, 39, 49, 43, 59, 51, 57, 59, 57, 63, 63, 63, 71, 61, 71, 69, 81, 69, 57, 67, 83, 91, 91, 95, 91, 87, 87, 81, 99, 93, 97, 107, 97, 87, 97, 107, 109, 95]