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.

A340646 a(n) = (prime(n)^n) mod prime(n+1).

Table of values

n a(n)
1 2
2 4
3 6
4 3
5 7
6 16
7 5
8 9
9 7
10 1
11 6
12 16
13 21
14 32
15 36
16 16
17 17
18 22
19 63
20 4
21 10
22 75
23 63
24 96
25 1
26 38
27 2
28 66
29 109
30 100
31 82
32 119
33 57
34 53
35 119
36 67
37 141
38 137
39 116
40 89
41 103
42 85
43 187
44 101
45 74
46 58
47 146
48 144
49 216
50 37
51 238
52 16
53 4
54 21
55 254
56 185
57 216
58 187
59 43
60 15
61 123
62 109
63 69

List of values

[2, 4, 6, 3, 7, 16, 5, 9, 7, 1, 6, 16, 21, 32, 36, 16, 17, 22, 63, 4, 10, 75, 63, 96, 1, 38, 2, 66, 109, 100, 82, 119, 57, 53, 119, 67, 141, 137, 116, 89, 103, 85, 187, 101, 74, 58, 146, 144, 216, 37, 238, 16, 4, 21, 254, 185, 216, 187, 43, 15, 123, 109, 69]