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.

A245077 Largest k such that the smallest prime satisfying Goldbach's conjecture is less than or equal to (2n)^(1/k).

Table of values

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

List of values

[2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 3, 3, 2, 1, 3, 2, 3, 3, 2, 3, 2, 2, 3, 2, 2, 3, 3, 2, 2, 3, 2, 3, 3, 2, 2, 4, 2, 4, 2, 2, 4, 2, 2, 1, 4, 2, 4, 4, 2, 4, 4, 2, 4, 2, 2, 1, 2, 1, 1, 4]