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.

A220235 a(n) = (2^n + 3^n) modulo n.

Table of values

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

List of values

[0, 1, 2, 1, 0, 1, 5, 1, 8, 3, 5, 1, 5, 13, 5, 1, 5, 1, 5, 17, 14, 13, 5, 1, 0, 13, 26, 13, 5, 13, 5, 1, 2, 13, 30, 1, 5, 13, 35, 17, 5, 37, 5, 9, 35, 13, 5, 1, 12, 23, 35, 45, 5, 1, 0, 41, 35, 13, 5, 37, 5, 13, 35, 1, 15, 1, 5, 29, 35, 13, 5, 1, 5, 13, 50]