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.

A175452 a(n) = smallest prime such that a(n)+2 is multiple of 2n+1.

Table of values

n a(n)
1 7
2 3
3 5
4 7
5 31
6 11
7 13
8 83
9 17
10 19
11 67
12 23
13 79
14 317
15 29
16 31
17 103
18 109
19 37
20 367
21 41
22 43
23 139
24 47
25 151
26 157
27 53
28 283
29 293
30 59
31 61
32 193
33 199
34 67
35 211
36 71
37 73
38 229
39 709
40 79
41 911
42 83
43 433
44 443
45 89
46 277
47 283
48 677
49 97
50 503
51 101
52 103
53 2459
54 107
55 109
56 337
57 113
58 349
59 593
60 1087

List of values

[7, 3, 5, 7, 31, 11, 13, 83, 17, 19, 67, 23, 79, 317, 29, 31, 103, 109, 37, 367, 41, 43, 139, 47, 151, 157, 53, 283, 293, 59, 61, 193, 199, 67, 211, 71, 73, 229, 709, 79, 911, 83, 433, 443, 89, 277, 283, 677, 97, 503, 101, 103, 2459, 107, 109, 337, 113, 349, 593, 1087]