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.

A332086 a(n) = pi(prime(n) + n) - n, where pi is the prime counting function.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 3, 3, 2, 3, 3, 4, 4, 4, 4, 3, 4, 4, 6, 5, 5, 4, 4, 4, 4, 6, 6, 6, 6, 7, 6, 7, 8, 7, 7, 6, 6, 8, 7, 8, 7, 8, 10, 9, 9, 10, 9, 9, 8, 9, 10, 9, 8, 8, 8, 7, 9, 10, 10, 9, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13]