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.

A225927 Least number of prime powers greater than 1 needed to sum up to n, or 0 if n cannot be represented as a sum of prime powers.

Table of values

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

List of values

[0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 2, 2, 0, 0, 1, 2, 2, 0, 2, 3, 3, 0, 2, 1, 3, 1, 3, 2, 4, 2, 1, 2, 2, 2, 2, 3, 3, 3, 2, 2, 3, 2, 3, 3, 4, 3, 2, 1, 2, 3, 2, 2, 2, 4, 3, 2, 2, 2, 3, 3, 3, 3, 1, 2, 3, 3, 2, 3, 3, 4, 2, 2, 2, 3, 2, 3, 3, 3, 2, 1, 3, 3, 3, 2, 3, 4, 3, 2, 2]