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.

A140361 Number of additions, subtractions, or multiplications necessary to reach n starting from 1 and 2.

Table of values

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

List of values

[0, 0, 0, 1, 1, 2, 2, 3, 2, 2, 3, 3, 3, 4, 3, 3, 2, 3, 3, 4, 3, 4, 4, 4, 3, 3, 4, 3, 4, 4, 4, 4, 3, 4, 4, 4, 3, 4, 4, 4, 4, 5, 4, 5, 5, 4, 5, 5, 4, 4, 4, 5, 5, 5, 4, 5, 4, 5, 5, 5, 4, 5, 4, 4, 3, 4, 4, 5, 4, 5, 5, 5, 4, 5, 5, 4, 5, 5, 4, 4, 4, 3, 4, 4, 4, 5, 5, 5, 5, 5, 4, 5, 5, 5, 5, 5, 4, 5, 5, 4]