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.

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

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 8
6 10
7 11
8 13
9 15
10 18
11 19
12 21
13 22
14 24
15 26
16 28
17 30
18 32
19 34
20 35
21 36
22 38
23 40
24 42
25 45
26 47
27 48
28 50
29 51
30 53
31 55
32 57
33 60
34 61
35 65
36 66
37 67
38 68
39 70
40 72
41 74
42 76
43 77
44 79
45 81
46 82
47 85
48 88
49 89
50 91
51 93
52 94
53 95
54 99
55 101
56 102
57 104
58 105
59 106
60 107
61 108
62 112
63 116
64 117

List of values

[1, 2, 4, 6, 8, 10, 11, 13, 15, 18, 19, 21, 22, 24, 26, 28, 30, 32, 34, 35, 36, 38, 40, 42, 45, 47, 48, 50, 51, 53, 55, 57, 60, 61, 65, 66, 67, 68, 70, 72, 74, 76, 77, 79, 81, 82, 85, 88, 89, 91, 93, 94, 95, 99, 101, 102, 104, 105, 106, 107, 108, 112, 116, 117]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.