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.

A177023 a(n) = 2^(2*n) mod (2*n+1).

Table of values

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

List of values

[1, 1, 1, 4, 1, 1, 4, 1, 1, 4, 1, 16, 13, 1, 1, 4, 9, 1, 4, 1, 1, 31, 1, 15, 4, 1, 49, 4, 1, 1, 4, 16, 1, 4, 1, 1, 34, 9, 1, 40, 1, 16, 4, 1, 64, 4, 54, 1, 58, 1, 1, 46, 1, 1, 4, 1, 39, 22, 30, 56, 4, 91, 1, 4, 1, 64, 94, 1, 1, 4, 114, 16, 25, 1, 1, 103, 109, 1, 4, 156, 1, 16, 1, 40, 85, 1, 134]