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.

A342176 Tower of primes modulo n: a(n) = (2^3^5^7^ ... ^prime(n)) mod n.

Table of values

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

List of values

[0, 0, 2, 0, 3, 2, 1, 0, 8, 8, 8, 8, 8, 8, 8, 0, 8, 8, 18, 8, 8, 8, 2, 8, 8, 8, 26, 8, 26, 8, 8, 0, 8, 8, 8, 8, 6, 18, 8, 8, 8, 8, 32, 8, 8, 2, 7, 32, 29, 8, 8, 8, 18, 26, 8, 8, 56, 26, 42, 8, 8, 8, 8, 0, 8, 8, 58, 8, 2, 8, 18, 8, 1, 6, 8, 56]