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.

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

Table of values

n a(n)
1 3
2 7
3 19
4 43
5 73
6 127
7 163
8 337
9 341
10 379
11 487
12 601
13 881
14 883
15 937
16 1387
17 1459
18 1801
19 2593
20 2647
21 2857
22 3079
23 3529
24 3673
25 3943
26 4057
27 4201
28 4681
29 5419
30 5461
31 5881
32 6121
33 6481
34 6529
35 6553
36 6571
37 6841
38 7481
39 7993
40 8233
41 8911
42 9001
43 9199
44 9241
45 9721
46 10261
47 10657
48 11161
49 11827
50 12241

List of values

[3, 7, 19, 43, 73, 127, 163, 337, 341, 379, 487, 601, 881, 883, 937, 1387, 1459, 1801, 2593, 2647, 2857, 3079, 3529, 3673, 3943, 4057, 4201, 4681, 5419, 5461, 5881, 6121, 6481, 6529, 6553, 6571, 6841, 7481, 7993, 8233, 8911, 9001, 9199, 9241, 9721, 10261, 10657, 11161, 11827, 12241]