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.

A360269 Least sum of 2's and 3's required to build n using +, * and parentheses.

Table of values

n a(n)
2 2
3 3
4 4
5 5
6 5
7 7
8 6
9 6
10 7
11 8
12 7
13 10
14 9
15 8
16 8
17 10
18 8
19 11
20 9
21 10
22 10
23 12
24 9
25 10
26 11
27 9
28 11
29 11
30 10
31 13
32 10
33 11
34 12
35 12
36 10
37 14
38 12
39 13
40 11
41 15
42 12
43 14
44 12
45 11
46 14
47 13
48 11
49 14
50 12
51 13
52 13
53 15
54 11
55 13
56 13
57 14
58 13
59 16
60 12
61 16
62 14
63 13
64 12
65 15
66 13
67 15
68 14
69 15
70 14

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.