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.

A293394 Numbers k such that (2*k-1)*(2^((k-1)/4)) == 1 (mod k).

Table of values

n a(n)
1 1
2 17
3 41
4 97
5 137
6 193
7 241
8 313
9 401
10 409
11 433
12 449
13 457
14 521
15 569
16 641
17 673
18 761
19 769
20 809
21 857
22 929
23 953
24 977
25 1009
26 1129
27 1297
28 1321
29 1361
30 1409
31 1489
32 1657
33 1697
34 1873
35 1993
36 2017
37 2081
38 2137
39 2153
40 2161

List of values

[1, 17, 41, 97, 137, 193, 241, 313, 401, 409, 433, 449, 457, 521, 569, 641, 673, 761, 769, 809, 857, 929, 953, 977, 1009, 1129, 1297, 1321, 1361, 1409, 1489, 1657, 1697, 1873, 1993, 2017, 2081, 2137, 2153, 2161]