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.

A269728 Let k be a number not a power of 2 (see A057716), and define r by 2^(r-1) < k < 2^r; a(n) is smallest prime of the form 2^r*m+1 such that the exponential sum S(sigma_{m,k}) avoids p.

Table of values

n a(n)
1 5
2 17
3 41
4 73
5 97
6 17
7 17
8 17
9 17
10 17
11 17
12 1601
13 97
14 97
15 449
16 257
17 97
18 97
19 97
20 97
21 193
22 257
23 97
24 97
25 97
26 449
27 193
28 1409
29 193
30 193
31 193
32 257
33 193
34 449
35 769
36 257
37 193
38 449
39 257
40 193
41 193
42 193
43 193
44 257
45 449
46 193
47 193
48 193
49 257
50 449
51 257
52 257
53 257
54 449
55 641

List of values

[5, 17, 41, 73, 97, 17, 17, 17, 17, 17, 17, 1601, 97, 97, 449, 257, 97, 97, 97, 97, 193, 257, 97, 97, 97, 449, 193, 1409, 193, 193, 193, 257, 193, 449, 769, 257, 193, 449, 257, 193, 193, 193, 193, 257, 449, 193, 193, 193, 257, 449, 257, 257, 257, 449, 641]