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.

A321857 a(n) = Pi(5,2)(n) + Pi(5,3)(n) - Pi(5,1)(n) - Pi(5,4)(n) where Pi(a,b)(x) denotes the number of primes in the arithmetic progression a*k + b less than or equal to x.

Table of values

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

List of values

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