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.

A225099 Number of ways n can be represented as a sum of two distinct nontrivial prime powers (numbers of the form p^k where p is a prime number and k >= 2).

Table of values

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

List of values

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