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.

A354914 The least cost to reach n using additions and multiplications, where multiplication is free.

Table of values

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

List of values

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