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.

A061313 Minimal number of steps to get from 1 to n by (a) subtracting 1 or (b) multiplying by 2.

Table of values

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

List of values

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