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.

A176176 Numbers k such that 2^(k-1) == 4^(k-1) (mod k).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 7
7 8
8 11
9 13
10 16
11 17
12 19
13 23
14 28
15 29
16 31
17 32
18 37
19 41
20 43
21 47
22 53
23 59
24 61
25 64
26 67
27 71
28 73
29 79
30 83
31 89
32 97
33 101
34 103
35 107
36 109
37 112
38 113
39 127
40 128
41 131
42 137
43 139
44 149
45 151
46 157
47 163
48 167

List of values

[1, 2, 3, 4, 5, 7, 8, 11, 13, 16, 17, 19, 23, 28, 29, 31, 32, 37, 41, 43, 47, 53, 59, 61, 64, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 112, 113, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167]