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.

A251482 a(n) = floor(prime(n)/log(n)) + ceiling(prime(n)/log(prime(n))) - 2*n, n >=2.

Table of values

n a(n)
2 3
3 2
4 1
5 1
6 1
7 1
8 0
9 0
10 1
11 0
12 1
13 1
14 0
15 0
16 1
17 1
18 0
19 0
20 0
21 -1
22 0
23 -1
24 0
25 2
26 0
27 0
28 -1
29 -2
30 -3
31 1
32 0
33 1
34 0
35 1
36 1
37 1
38 0
39 0
40 0
41 1
42 -1
43 1
44 0
45 -1
46 -3
47 0
48 3
49 2
50 1
51 0
52 0
53 -2
54 0
55 1
56 1
57 1
58 -1
59 -1
60 -2
61 -3
62 -2
63 2
64 1
65 -1
66 -1
67 2
68 1
69 3
70 2
71 1
72 1
73 2
74 1
75 1
76 1
77 1
78 2
79 0
80 2
81 3
82 1
83 3
84 1
85 1
86 0
87 0
88 1
89 0
90 -2
91 -3
92 -1
93 0
94 0
95 0
96 -1
97 -1
98 1
99 -1
100 3

List of values

[3, 2, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, -1, 0, -1, 0, 2, 0, 0, -1, -2, -3, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, -1, 1, 0, -1, -3, 0, 3, 2, 1, 0, 0, -2, 0, 1, 1, 1, -1, -1, -2, -3, -2, 2, 1, -1, -1, 2, 1, 3, 2, 1, 1, 2, 1, 1, 1, 1, 2, 0, 2, 3, 1, 3, 1, 1, 0, 0, 1, 0, -2, -3, -1, 0, 0, 0, -1, -1, 1, -1, 3]