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.

A099053 a(n) is the smallest number of 1s and 2s that are needed to construct n using any number of +, -, *, ^ signs but not allowing concatenation of digits.

Table of values

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

List of values

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