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.

A375794 Numbers k such that 2^k == 2 (mod ((k - 1)*k/2)) and not 2^k == 2 (mod ((k - 1)*k)).

Table of values

n a(n)
1 5
2 13
3 37
4 61
5 101
6 109
7 157
8 181
9 421
10 541
11 661
12 757
13 821
14 1093
15 1621
16 1861
17 2029
18 2053
19 2269
20 2341
21 2437
22 2701
23 2917
24 3277
25 3301
26 3613
27 4621
28 4789
29 4861
30 5461
31 5501
32 5581
33 6301
34 6661
35 7309
36 8101
37 8269
38 8581
39 8821
40 8893
41 9829
42 9901
43 10141
44 10261
45 10501
46 10837
47 11701
48 12101
49 12301

List of values

[5, 13, 37, 61, 101, 109, 157, 181, 421, 541, 661, 757, 821, 1093, 1621, 1861, 2029, 2053, 2269, 2341, 2437, 2701, 2917, 3277, 3301, 3613, 4621, 4789, 4861, 5461, 5501, 5581, 6301, 6661, 7309, 8101, 8269, 8581, 8821, 8893, 9829, 9901, 10141, 10261, 10501, 10837, 11701, 12101, 12301]