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.

A186645 Numbers k such that 2^(k-1) == 1 + b*k (mod k^2), where b divides k-1.

Table of values

n a(n)
1 3
2 7
3 11
4 13
5 19
6 29
7 31
8 37
9 71
10 127
11 379
12 491
13 2047
14 2633
15 2659
16 3373
17 8191
18 13249
19 26893
20 70687
21 74597
22 87211
23 131071
24 184511
25 524287
26 642581
27 1897121
28 2676301
29 2703739
30 8388607
31 15456151
32 52368101
33 102785339
34 126233057
35 193481677
36 536870911
37 856645921
38 1552107133
39 2001907169
40 2147483647
41 2935442621
42 3668158729
43 6004262437

List of values

[3, 7, 11, 13, 19, 29, 31, 37, 71, 127, 379, 491, 2047, 2633, 2659, 3373, 8191, 13249, 26893, 70687, 74597, 87211, 131071, 184511, 524287, 642581, 1897121, 2676301, 2703739, 8388607, 15456151, 52368101, 102785339, 126233057, 193481677, 536870911, 856645921, 1552107133, 2001907169, 2147483647, 2935442621, 3668158729, 6004262437]