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.

A307512 a(n) is the smallest k > 2^n such that 2^(k-1) == 1 (mod (2^n-1)*k).

Table of values

n a(n)
1 3
2 5
3 13
4 17
5 41
6 67
7 197
8 257
9 523
10 1031
11 2069
12 4129
13 8243
14 16451
15 32911
16 65537
17 131479
18 262153
19 524591
20 1048601
21 2097229
22 4194389
23 8388791
24 16777441
25 33554501
26 67108913
27 134217757
28 268435889
29 536871259
30 1073741971
31 2147484949
32 4294967297
33 8589934651
34 17179869827

List of values

[3, 5, 13, 17, 41, 67, 197, 257, 523, 1031, 2069, 4129, 8243, 16451, 32911, 65537, 131479, 262153, 524591, 1048601, 2097229, 4194389, 8388791, 16777441, 33554501, 67108913, 134217757, 268435889, 536871259, 1073741971, 2147484949, 4294967297, 8589934651, 17179869827]