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.

A086833 Minimum number of different addends occurring in any shortest addition chain of Brauer type for a given n, or 0 if n has no shortest addition chain of Brauer type.

Table of values

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

List of values

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