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.

A065813 Least m such that (p^(2*m+1)-1)/(p-1) is a prime, where p = prime(n).

Table of values

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

List of values

[1, 1, 1, 2, 8, 2, 1, 9, 2, 2, 3, 6, 1, 2, 63, 5, 1, 3, 9, 1, 2, 2, 2, 1, 8, 1, 9, 8, 8, 11, 2, 1, 5, 81, 3, 6, 8, 3, 1, 1, 9, 8, 8, 2, 15, 288, 20, 119, 2, 5, 56, 2, 8, 3, 11, 2]