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.

A216822 Numbers n such that 2^n == 2 (mod n*(n+1)).

Table of values

n a(n)
1 1
2 5
3 13
4 29
5 37
6 61
7 73
8 157
9 181
10 193
11 277
12 313
13 397
14 421
15 457
16 541
17 561
18 613
19 661
20 673
21 733
22 757
23 877
24 997
25 1093
26 1153
27 1201
28 1213
29 1237
30 1289
31 1321
32 1381
33 1453
34 1621
35 1657
36 1753
37 1873
38 1905
39 1933
40 1993
41 2017
42 2137
43 2341
44 2473
45 2557
46 2593
47 2797
48 2857
49 2917

List of values

[1, 5, 13, 29, 37, 61, 73, 157, 181, 193, 277, 313, 397, 421, 457, 541, 561, 613, 661, 673, 733, 757, 877, 997, 1093, 1153, 1201, 1213, 1237, 1289, 1321, 1381, 1453, 1621, 1657, 1753, 1873, 1905, 1933, 1993, 2017, 2137, 2341, 2473, 2557, 2593, 2797, 2857, 2917]