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.

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

Table of values

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

List of values

[1, 2, 0, 3, 4, 4, 0, 2, 6, 6, 4, 7, 8, 2, 0, 9, 16, 10, 4, 2, 12, 12, 16, 8, 14, 20, 4, 15, 16, 16, 0, 2, 18, 22, 16, 19, 20, 2, 24, 21, 16, 22, 4, 38, 24, 24, 16, 32, 6, 2, 4, 27, 34, 52, 8, 2, 30, 30, 4, 31, 32, 2, 0, 8, 16, 34, 4, 2, 46, 36, 16, 37, 38, 17]