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.

A212844 a(n) = 2^(n+2) mod n.

Table of values

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

List of values

[0, 0, 2, 0, 3, 4, 1, 0, 5, 6, 8, 4, 8, 2, 2, 0, 8, 4, 8, 4, 11, 16, 8, 16, 3, 16, 23, 8, 8, 16, 8, 0, 32, 16, 2, 4, 8, 16, 32, 24, 8, 4, 8, 20, 23, 16, 8, 16, 22, 46, 32, 12, 8, 4, 7, 16, 32, 16, 8, 4, 8, 16, 32, 0, 63, 58, 8, 64, 32, 36, 8, 40, 8, 16, 47]