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.

A117632 Number of 1's required to build n using {+,T} and parentheses, where T(i) = i*(i+1)/2.

Table of values

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

List of values

[1, 2, 2, 3, 4, 2, 3, 4, 4, 3, 4, 4, 5, 6, 4, 5, 6, 6, 7, 6, 2, 3, 4, 4, 5, 6, 4, 3, 4, 5, 5, 6, 6, 5, 6, 4, 5, 6, 6, 7, 8, 4, 5, 6, 4, 5, 6, 6, 5, 6, 6, 7, 8, 8, 3, 4, 5, 5, 6, 7, 5, 6, 6, 7, 6, 4, 5, 6, 6, 7, 8, 6, 7, 8, 8, 5, 6, 4, 5, 6, 6, 7, 6, 6, 7, 8, 6, 7, 8, 8, 5, 6, 7, 7, 8, 9, 7, 8, 6, 7, 8, 8]