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.

A085252 Number of ways to write n as sum of two powerful numbers (A001694).

Table of values

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

List of values

[0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 2, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 2, 1, 1, 2, 1, 0, 0, 2, 2, 0, 1, 1, 1, 0, 0, 1, 0, 2, 0, 2, 1, 1, 0, 0, 2, 1, 1, 0, 1, 0, 1, 1, 2, 0, 0, 2, 0, 0, 0, 2, 2, 1, 0, 2, 0, 0, 0, 2, 2, 1, 0, 0, 2, 0, 0, 1, 2, 1, 1, 0, 0, 0, 0, 1, 2, 1, 1, 1, 1, 0]