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.

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

Table of values

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

List of values

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