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.

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

Table of values

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

List of values

[1, 1, 0, 2, 4, 3, 0, 7, 6, 5, 4, 6, 8, 13, 0, 8, 16, 9, 4, 19, 12, 11, 16, 17, 14, 7, 4, 14, 16, 15, 0, 31, 18, 13, 16, 18, 20, 37, 24, 20, 16, 21, 4, 7, 24, 23, 16, 17, 6, 49, 4, 26, 34, 3, 8, 55, 30, 29, 4, 30, 32, 61, 0, 57, 16, 33, 4, 67, 46, 35, 16, 36, 38]