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.

A340781 a(n) = (n - 1)*prime(n + 1) mod prime(n).

Table of values

n a(n)
1 0
2 2
3 4
4 5
5 8
6 7
7 12
8 9
9 2
10 18
11 29
12 7
13 24
14 9
15 37
16 37
17 32
18 41
19 5
20 38
21 47
22 5
23 49
24 6
25 96
26 50
27 1
28 54
29 3
30 67
31 120
32 55
33 64
34 52
35 68
36 59
37 59
38 148
39 61
40 61
41 80
42 48
43 84
44 172
45 88
46 142
47 130
48 188
49 96
50 196
51 67
52 102
53 38
54 67
55 67
56 67
57 112
58 71
59 232
60 118
61 34
62 268
63 248
64 126
65 256
66 276

List of values

[0, 2, 4, 5, 8, 7, 12, 9, 2, 18, 29, 7, 24, 9, 37, 37, 32, 41, 5, 38, 47, 5, 49, 6, 96, 50, 1, 54, 3, 67, 120, 55, 64, 52, 68, 59, 59, 148, 61, 61, 80, 48, 84, 172, 88, 142, 130, 188, 96, 196, 67, 102, 38, 67, 67, 67, 112, 71, 232, 118, 34, 268, 248, 126, 256, 276]