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.

A263001 Number of ordered pairs (k, m) with k > 0 and m > 0 such that n = pi(k*(k+1)) + pi(m*(m+1)/2), where pi(x) denotes the number of primes not exceeding x.

Table of values

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

List of values

[1, 0, 2, 1, 3, 1, 3, 2, 3, 3, 3, 4, 3, 4, 2, 5, 4, 2, 7, 2, 4, 5, 2, 7, 2, 5, 4, 4, 5, 3, 5, 6, 4, 5, 6, 3, 6, 6, 2, 9, 3, 5, 5, 5, 6, 5, 6, 5, 4, 7, 4, 7, 4, 5, 6, 7, 3, 5, 6, 7, 4, 7, 7, 5, 3, 9, 5, 7, 3, 8, 7, 5, 4, 8, 6, 6, 3, 10, 7, 3, 3, 11, 5, 7, 4, 8, 5, 4, 7, 7, 5, 8, 3, 8, 7, 4, 5, 9, 6, 9]