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.

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

Table of values

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

List of values

[0, 1, 0, 1, 3, 5, 3, 1, 0, 5, 3, 5, 3, 5, 9, 1, 3, 11, 3, 17, 9, 5, 3, 17, 8, 5, 0, 17, 3, 5, 3, 1, 9, 5, 19, 29, 3, 5, 9, 17, 3, 23, 3, 17, 18, 5, 3, 17, 31, 25, 9, 17, 3, 29, 44, 33, 9, 5, 3, 17, 3, 5, 9, 1, 33, 65, 3, 17, 9, 45, 3, 65, 3, 5, 69, 17, 19, 65, 3, 17, 0, 5, 3, 65, 33, 5, 9, 81, 3]