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.

A087139 Least k>1 such that p^k - p^(k-1) + 1 is prime for p = prime(n).

Table of values

n a(n)
1 2
2 2
3 3
4 2
5 11
6 2
7 5
8 30
9 15
10 3
11 6
12 10
13 81
14 3
15 17
16 961
17 15
18 7
19 2
20 5
21 6
22 2
23 3
24 3
25 12
26 3
27 57
28 5
29 16
30 5
31 166
32 15
33 13
34 2
35 3
36 2
37 30
38 2
39 25
40 3
41 47
42 3
43 3
44 2
45 521
46 9
47 3
48 15
49 17
50 42
51 17
52 51
53 39

List of values

[2, 2, 3, 2, 11, 2, 5, 30, 15, 3, 6, 10, 81, 3, 17, 961, 15, 7, 2, 5, 6, 2, 3, 3, 12, 3, 57, 5, 16, 5, 166, 15, 13, 2, 3, 2, 30, 2, 25, 3, 47, 3, 3, 2, 521, 9, 3, 15, 17, 42, 17, 51, 39]