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.

A005766 a(n) = cost of minimal multiplication-cost addition chain for n.

Table of values

n a(n)
1 0
2 1
3 3
4 5
5 9
6 12
7 18
8 21
9 29
10 34
11 44
12 48
13 60
14 67
15 81
16 85
17 101
18 110
19 128
20 134
21 154
22 165
23 187
24 192
25 216
26 229
27 255
28 263
29 291
30 306
31 336
32 341
33 373
34 390
35 424
36 434
37 470
38 489
39 527
40 534
41 574
42 595
43 637
44 649
45 693
46 716
47 762
48 768
49 816
50 841
51 891
52 905
53 957
54 984
55 1038

List of values

[0, 1, 3, 5, 9, 12, 18, 21, 29, 34, 44, 48, 60, 67, 81, 85, 101, 110, 128, 134, 154, 165, 187, 192, 216, 229, 255, 263, 291, 306, 336, 341, 373, 390, 424, 434, 470, 489, 527, 534, 574, 595, 637, 649, 693, 716, 762, 768, 816, 841, 891, 905, 957, 984, 1038]

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

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