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.

A016108 Numbers k=3*m+1 such that 2^m == 1 (mod k).

Table of values

n a(n)
1 1
2 31
3 43
4 109
5 127
6 157
7 223
8 229
9 277
10 283
11 307
12 397
13 433
14 439
15 457
16 499
17 601
18 643
19 691
20 727
21 733
22 739
23 811
24 919
25 997
26 1021
27 1051
28 1069
29 1093
30 1327
31 1399
32 1423
33 1459
34 1471
35 1579
36 1597
37 1627
38 1657
39 1699
40 1723
41 1729
42 1753
43 1777
44 1789
45 1801
46 1831
47 1933
48 1999
49 2017
50 2047
51 2089
52 2113
53 2143
54 2179
55 2203

List of values

[1, 31, 43, 109, 127, 157, 223, 229, 277, 283, 307, 397, 433, 439, 457, 499, 601, 643, 691, 727, 733, 739, 811, 919, 997, 1021, 1051, 1069, 1093, 1327, 1399, 1423, 1459, 1471, 1579, 1597, 1627, 1657, 1699, 1723, 1729, 1753, 1777, 1789, 1801, 1831, 1933, 1999, 2017, 2047, 2089, 2113, 2143, 2179, 2203]