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.

A187279 a(n) is the least number of terms needed to represent n as a sum of powers of the same prime.

Table of values

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

List of values

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