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.

A337978 a(n) = n + pi(n) - pi(n + pi(n)), where pi(n) is the prime count of n (n>=1).

Table of values

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

List of values

[1, 1, 2, 3, 4, 5, 6, 7, 7, 8, 10, 10, 11, 12, 13, 14, 15, 16, 18, 19, 19, 20, 21, 22, 23, 24, 25, 25, 27, 28, 29, 29, 30, 31, 32, 32, 34, 35, 36, 37, 38, 39, 41, 42, 42, 43, 44, 45, 46, 47, 48, 48, 50, 51, 51, 52, 52, 53, 55, 56, 57, 58, 59, 60, 60, 61, 63]

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

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