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.

A262746 Number of ordered ways to write n as x^2 + y^2 + pi(z^2) with 0 <= x <= y and z > 0 such that 2*x*y + 3 is prime, where pi(m) denotes the number of primes not exceeding m.

Table of values

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

List of values

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