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.

A306560 Smallest number of 1's required to build n using +, *, ^ and tetration.

Table of values

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

List of values

[1, 2, 3, 4, 5, 5, 6, 5, 5, 6, 7, 7, 8, 8, 8, 5, 6, 7, 8, 8, 9, 9, 10, 8, 7, 8, 5, 6, 7, 8, 9, 7, 8, 8, 9, 7, 8, 9, 10, 10, 11, 11, 10, 11, 10, 11, 12, 8, 8, 9, 9, 10, 11, 7, 8, 8, 9, 9, 10, 10, 11, 11, 11, 7, 8, 9, 10, 10, 11, 11, 12, 9, 10, 10, 10, 11, 12, 11, 12, 10, 7, 8, 9, 9, 10, 11, 10]