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.

A112983 a(n) = 2^(n+1) mod n.

Table of values

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

List of values

[0, 0, 1, 0, 4, 2, 4, 0, 7, 8, 4, 8, 4, 8, 1, 0, 4, 2, 4, 12, 16, 8, 4, 8, 14, 8, 25, 4, 4, 8, 4, 0, 16, 8, 1, 20, 4, 8, 16, 32, 4, 2, 4, 32, 34, 8, 4, 32, 11, 48, 16, 32, 4, 2, 31, 8, 16, 8, 4, 32, 4, 8, 16, 0, 64, 62, 4, 32, 16, 18, 4, 56, 4, 8, 61, 32, 36, 50, 4]