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.

A175625 Numbers k such that gcd(k, 6) = 1, 2^(k-1) == 1 (mod k), and 2^(k-3) == 1 (mod (k-1)/2).

Table of values

n a(n)
1 7
2 11
3 23
4 31
5 47
6 59
7 83
8 107
9 167
10 179
11 227
12 263
13 347
14 359
15 383
16 467
17 479
18 503
19 563
20 587
21 683
22 719
23 839
24 863
25 887
26 983
27 1019
28 1123
29 1187
30 1283
31 1291
32 1307
33 1319
34 1367
35 1439
36 1487
37 1523
38 1619
39 1823
40 1907
41 2027
42 2039
43 2063
44 2099
45 2207
46 2447
47 2459
48 2543

List of values

[7, 11, 23, 31, 47, 59, 83, 107, 167, 179, 227, 263, 347, 359, 383, 467, 479, 503, 563, 587, 683, 719, 839, 863, 887, 983, 1019, 1123, 1187, 1283, 1291, 1307, 1319, 1367, 1439, 1487, 1523, 1619, 1823, 1907, 2027, 2039, 2063, 2099, 2207, 2447, 2459, 2543]