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.

A257647 Least k such that k*2^m + 1 has a covering set of modulus 2*n, or 0 if no such value exists.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 271129
13 0
14 0
15 0
16 0
17 0
18 78557
19 0
20 0
21 0
22 0
23 0
24 327739
25 0
26 0
27 0
28 0
29 0
30 169073869
31 0
32 201446503145165177
33 0
34 0
35 0
36 1777613
37 0
38 0
39 0

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 271129, 0, 0, 0, 0, 0, 78557, 0, 0, 0, 0, 0, 327739, 0, 0, 0, 0, 0, 169073869, 0, 201446503145165177, 0, 0, 0, 1777613, 0, 0, 0]