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.

A246777 a(n) = A246776(A005669(n)): using the indices of maximal primes in A002386 in order to verify the Firoozbakht conjecture for 0 <= floor(prime(n)^(1+1/n)) - prime(n+1).

Table of values

n a(n)
1 1
2 0
3 0
4 3
5 10
6 5
7 16
8 19
9 20
10 10
11 38
12 38
13 35
14 24
15 43
16 53
17 38
18 43
19 66
20 52
21 46
22 65
23 79
24 55
25 73
26 104
27 109
28 95
29 120
30 92
31 130
32 130
33 121
34 127
35 114
36 127
37 155
38 148
39 92
40 109
41 159
42 171
43 173
44 180
45 171
46 157
47 171
48 161
49 174
50 178
51 168
52 165
53 169
54 135
55 171
56 168
57 138
58 174
59 195
60 234
61 149
62 253
63 269
64 61
65 244
66 248
67 255
68 323
69 304
70 307
71 262
72 245
73 234
74 215
75 228

List of values

[1, 0, 0, 3, 10, 5, 16, 19, 20, 10, 38, 38, 35, 24, 43, 53, 38, 43, 66, 52, 46, 65, 79, 55, 73, 104, 109, 95, 120, 92, 130, 130, 121, 127, 114, 127, 155, 148, 92, 109, 159, 171, 173, 180, 171, 157, 171, 161, 174, 178, 168, 165, 169, 135, 171, 168, 138, 174, 195, 234, 149, 253, 269, 61, 244, 248, 255, 323, 304, 307, 262, 245, 234, 215, 228]