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.

A340128 a(n) = (n*prime(n)) mod prime(n+1).

Table of values

n a(n)
1 2
2 1
3 1
4 6
5 3
6 10
7 5
8 14
9 4
10 11
11 8
12 34
13 17
14 38
15 16
16 22
17 27
18 26
19 66
20 33
21 32
22 78
23 40
24 2
25 1
26 51
27 106
28 53
29 110
30 88
31 7
32 82
33 73
34 107
35 81
36 98
37 104
38 15
39 112
40 118
41 99
42 153
43 107
44 21
45 109
46 81
47 105
48 35
49 131
50 33
51 172
52 137
53 223
54 190
55 196
56 202
57 157
58 206
59 45
60 163
61 269
62 53

List of values

[2, 1, 1, 6, 3, 10, 5, 14, 4, 11, 8, 34, 17, 38, 16, 22, 27, 26, 66, 33, 32, 78, 40, 2, 1, 51, 106, 53, 110, 88, 7, 82, 73, 107, 81, 98, 104, 15, 112, 118, 99, 153, 107, 21, 109, 81, 105, 35, 131, 33, 172, 137, 223, 190, 196, 202, 157, 206, 45, 163, 269, 53]