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.

A308342 Number of ways to write 2*n as phi(x^2) + phi(y^2) + phi(z^2), where x,y,z are positive integers with x <= y <= z, and phi(.) is Euler's totient function (A000010).

Table of values

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

List of values

[0, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 3, 3, 1, 2, 3, 4, 4, 3, 4, 5, 4, 6, 5, 5, 5, 5, 5, 5, 4, 5, 4, 4, 2, 5, 5, 3, 6, 6, 3, 7, 6, 6, 6, 5, 6, 6, 4, 5, 5, 5, 5, 6, 4, 5, 8, 7, 5, 9, 6, 7, 8, 8, 7, 6, 6, 8, 5, 7, 7, 6, 5, 6, 8, 8, 8, 10, 6, 10, 13, 10, 10, 9, 6, 11, 9, 7, 3, 9, 6, 6, 9, 7, 5, 12]