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.

A115614 Numbers n such that the smallest possible number of multiplications required to compute x^n is by 2 less than the number of multiplications obtained by Knuth's power tree method.

Table of values

n a(n)
1 8719
2 17438
3 28597
4 34876
5 54359
6 56157
7 57194
8 57293
9 59657
10 60493
11 67171
12 69752
13 71017
14 71065
15 75799
16 78865
17 100987
18 108503
19 108718
20 110361
21 112093
22 112314
23 112679
24 113275
25 114388
26 114586
27 115861
28 119314
29 119417
30 120986
31 133681
32 133795

List of values

[8719, 17438, 28597, 34876, 54359, 56157, 57194, 57293, 59657, 60493, 67171, 69752, 71017, 71065, 75799, 78865, 100987, 108503, 108718, 110361, 112093, 112314, 112679, 113275, 114388, 114586, 115861, 119314, 119417, 120986, 133681, 133795]

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

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