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.

A294717 Numbers k such that 2^((k-1)/3) == 1 (mod k) and (2*k-1)*(2^((k-1)/6)) == 1 (mod k).

Table of values

n a(n)
1 1
2 43
3 109
4 157
5 229
6 277
7 283
8 307
9 397
10 499
11 643
12 691
13 733
14 739
15 811
16 997
17 1021
18 1051
19 1069
20 1093
21 1459
22 1579
23 1597
24 1627
25 1699
26 1723
27 1789
28 1933
29 2179
30 2203
31 2251
32 2341
33 2347
34 2731
35 2749
36 2917
37 2971
38 3061
39 3163
40 3181
41 3229
42 3259
43 3277
44 3331
45 3373
46 3541
47 4027

List of values

[1, 43, 109, 157, 229, 277, 283, 307, 397, 499, 643, 691, 733, 739, 811, 997, 1021, 1051, 1069, 1093, 1459, 1579, 1597, 1627, 1699, 1723, 1789, 1933, 2179, 2203, 2251, 2341, 2347, 2731, 2749, 2917, 2971, 3061, 3163, 3181, 3229, 3259, 3277, 3331, 3373, 3541, 4027]