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.

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

Table of values

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

List of values

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