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.

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

Table of values

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

List of values

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