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.

A262436 Number of ways to represent 2n - 1 as p^2 + q^2 + r with p, q, and r prime, and p >= q.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 1, 2, 0, 1, 2, 1, 2, 1, 1, 3, 0, 1, 3, 2, 2, 0, 2, 2, 2, 2, 2, 4, 2, 1, 4, 3, 3, 2, 3, 3, 1, 3, 4, 4, 5, 0, 2, 5, 2, 4, 3, 2, 4, 1, 4, 3, 5, 2, 3, 5, 1, 4, 6, 2, 5, 2, 2, 4, 3, 3, 3, 5, 3, 3, 5, 2, 4, 6, 3, 3, 4, 2, 6, 6, 3, 3, 5, 3, 3, 6, 3]