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.

A363968 Least number of 1's needed to represent n using only additions +, subtractions -, multiplications *, divisions /, concatenations # and parentheses ().

Table of values

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

List of values

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

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

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