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.

A079302 a(n) = number of shortest addition chains for n that are non-Brauer chains.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 3, 0, 0, 0, 1, 2, 0, 0, 18, 0, 13, 0, 0, 0, 0, 0, 6, 5, 2, 0, 3, 6, 0, 0, 0, 0, 37, 0, 1, 2, 0, 3, 34, 0, 17, 0, 25, 44, 4, 0, 15, 32, 7, 0, 0, 0, 0, 0, 3, 0, 244, 0, 7, 13, 2, 8, 0, 6, 129, 0, 3, 6]

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

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