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.

A262982 Number of ordered ways to write n as x^4 + phi(y^2) + z*(z+1)/2 with x >= 0, y > 0 and z > 0, where phi(.) is Euler's totient function given by A000010.

Table of values

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

List of values

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