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.

A056792 Minimal number of steps to get from 0 to n by (a) adding 1 or (b) multiplying by 2.

Table of values

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

List of values

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