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.

A176817 Nonprimes k such that 2^(k-1) == 4^(k-1) (mod k).

Table of values

n a(n)
1 1
2 4
3 8
4 16
5 28
6 32
7 64
8 112
9 128
10 256
11 341
12 448
13 496
14 512
15 561
16 645
17 1016
18 1024
19 1105
20 1288
21 1387
22 1729
23 1792
24 1905
25 2044
26 2047
27 2048
28 2416
29 2465
30 2701
31 2821
32 3277
33 4033
34 4096
35 4369
36 4371
37 4672
38 4681
39 4984
40 5461
41 6601
42 7168
43 7936
44 7957
45 8128
46 8192
47 8321
48 8481
49 8911

List of values

[1, 4, 8, 16, 28, 32, 64, 112, 128, 256, 341, 448, 496, 512, 561, 645, 1016, 1024, 1105, 1288, 1387, 1729, 1792, 1905, 2044, 2047, 2048, 2416, 2465, 2701, 2821, 3277, 4033, 4096, 4369, 4371, 4672, 4681, 4984, 5461, 6601, 7168, 7936, 7957, 8128, 8192, 8321, 8481, 8911]