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.

A005208 Operator-oriented complexity of n, i.e., the minimum number of occurrences of +, *, and ^ needed to build n from a supply of ones.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.