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.

A262311 Number of ordered ways to write n = x^2 + y^2 + phi(z^2) (0 <= x <= y and z > 0) with y or z prime, where phi(.) is Euler's totient function given by A000010.

Table of values

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

List of values

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