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.

A351065 Number of different ways to obtain n as a sum of the minimal possible number of positive perfect powers with different exponents (considering only minimal possible exponents for bases equal to 1).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 3, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 5, 2, 2, 2, 4, 1, 1, 1, 3, 4, 1, 2, 3, 1, 1, 2, 3, 2, 3, 3, 1, 1, 1, 1, 2, 6, 1, 4]