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.

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

Table of values

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

List of values

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