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.

A233386 Number of ways to write n = i + j + k with 0 < i <= j <= k and i, j, k not all equal such that phi(i)*phi(j)*phi(k) is a cube.

Table of values

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

List of values

[0, 0, 0, 1, 1, 0, 0, 0, 1, 3, 2, 3, 4, 3, 4, 4, 4, 5, 3, 3, 1, 2, 6, 5, 5, 6, 7, 8, 8, 7, 8, 13, 7, 9, 4, 6, 8, 10, 7, 11, 14, 12, 8, 9, 10, 14, 12, 9, 9, 8, 8, 11, 8, 9, 19, 14, 12, 9, 11, 19, 12, 19, 10, 15, 13, 22, 18, 27, 22, 31, 20, 22, 18, 25, 25, 24, 18, 22, 19, 21, 24, 22, 30, 31, 35, 25, 28, 32, 23, 27, 28, 29, 23, 24, 30, 30, 29, 30, 33, 31]