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.

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

Table of values

n a(n)
1 1
2 1
3 3
4 4
5 10
6 1
7 9
8 5
9 16
10 9
11 26
12 10
13 33
14 1
15 2
16 49
17 33
18 3
19 35
20 48
21 3
22 32
23 62
24 64
25 4
26 20
27 8
28 62
29 93
30 83
31 64
32 41
33 68
34 79
35 138
36 125
37 88
38 56
39 4
40 169
41 72
42 36
43 40
44 144
45 73
46 140
47 63
48 120
49 24
50 218
51 67
52 48
53 58
54 194
55 126
56 54
57 74
58 223
59 74
60 59
61 176
62 161
63 280
64 208
65 215
66 236
67 82
68 141
69 139
70 344
71 7

List of values

[1, 1, 3, 4, 10, 1, 9, 5, 16, 9, 26, 10, 33, 1, 2, 49, 33, 3, 35, 48, 3, 32, 62, 64, 4, 20, 8, 62, 93, 83, 64, 41, 68, 79, 138, 125, 88, 56, 4, 169, 72, 36, 40, 144, 73, 140, 63, 120, 24, 218, 67, 48, 58, 194, 126, 54, 74, 223, 74, 59, 176, 161, 280, 208, 215, 236, 82, 141, 139, 344, 7]