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.

A079301 a(n) = number of shortest addition chains for n that are Brauer chains.

Table of values

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

List of values

[1, 1, 1, 1, 2, 2, 5, 1, 3, 4, 15, 3, 9, 14, 4, 1, 2, 7, 31, 6, 26, 40, 4, 4, 13, 22, 5, 23, 114, 12, 64, 1, 2, 4, 43, 12, 33, 87, 18, 8, 20, 78, 4, 69, 14, 8, 183, 5, 11, 34, 4, 35, 171, 16, 139, 32, 148, 308, 33, 24, 76, 201, 80, 1, 2, 4, 23, 6, 26, 134, 1014]