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.

A073454 Number of repeated remainders arising when n is divided by all primes up to n: a(n) = pi(n) - A073453(n).

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 1, 2, 2, 3, 3, 3, 2, 2, 2, 2, 1, 2, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 3, 3, 3, 3, 2, 2, 2, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 4, 3, 3, 2, 3, 2, 2, 2, 2, 2, 3]