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.

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

List of values

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