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.

A263107 Number of ordered pairs (k, m) with k > 0 and m > 0 such that n = pi(k^2/2) + pi(3*m^2/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 2
5 2
6 1
7 3
8 2
9 2
10 3
11 3
12 3
13 3
14 3
15 3
16 3
17 4
18 4
19 1
20 4
21 5
22 1
23 6
24 3
25 4
26 5
27 2
28 4
29 5
30 2
31 5
32 5
33 3
34 4
35 5
36 4
37 6
38 2
39 4
40 4
41 6
42 3
43 4
44 5
45 2
46 6
47 8
48 1
49 5
50 6
51 2
52 4
53 7
54 3
55 6
56 5
57 2
58 6
59 7
60 1
61 4
62 7
63 3
64 6
65 5
66 3
67 7
68 4
69 5
70 5
71 6
72 5
73 5
74 4
75 2
76 6
77 10
78 3
79 4
80 6
81 5
82 3
83 6
84 5
85 7
86 3

List of values

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