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.

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

Table of values

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

List of values

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