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.

A293771 Minimum number of steps needed to compute n using a machine that can read, write and add starting with the number 1.

Table of values

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

List of values

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