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.

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

Table of values

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

List of values

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