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.

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

Table of values

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

List of values

[1, 1, 1, 3, 3, 3, 3, 5, 3, 6, 3, 6, 4, 6, 4, 7, 4, 6, 6, 6, 4, 8, 5, 6, 6, 7, 5, 8, 4, 9, 5, 7, 9, 5, 7, 8, 6, 9, 5, 9, 7, 7, 8, 8, 6, 8, 8, 8, 6, 7, 10, 8, 4, 12, 6, 8, 7, 9, 6, 10, 6, 8, 10, 8, 6, 12, 4, 12, 6, 11, 6, 11, 6, 9, 10, 8, 7, 11, 7, 10, 8, 9, 7, 10, 7, 13, 5, 7, 11, 9, 6, 8, 12, 8, 7, 11, 7, 12, 5]