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.

A073819 a(n) = prime(i) such that prime(i)*(n+1-i) is maximized (1 <= i <= n).

Table of values

n a(n)
1 2
2 2
3 2
4 5
5 5
6 11
7 11
8 11
9 11
10 17
11 17
12 17
13 17
14 29
15 29
16 29
17 29
18 29
19 37
20 37
21 37
22 41
23 41
24 41
25 41
26 59
27 59
28 59
29 59
30 59
31 59
32 59
33 67
34 67
35 67
36 71
37 71
38 97
39 97
40 97
41 97
42 97
43 97
44 97
45 97
46 97
47 97
48 97
49 97
50 127
51 127
52 127
53 127
54 127
55 127
56 127
57 127
58 149
59 149
60 149
61 149
62 149
63 149
64 149
65 149

List of values

[2, 2, 2, 5, 5, 11, 11, 11, 11, 17, 17, 17, 17, 29, 29, 29, 29, 29, 37, 37, 37, 41, 41, 41, 41, 59, 59, 59, 59, 59, 59, 59, 67, 67, 67, 71, 71, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 127, 127, 127, 127, 127, 127, 127, 127, 149, 149, 149, 149, 149, 149, 149, 149]