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.

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

Table of values

n a(n)
1 6475341
2 13214509
3 17900677
4 19998021
5 25747725
6 26429018
7 26640937
8 27321991
9 27404041
10 27492775
11 27820465
12 28475829
13 28475875
14 28803235
15 31947953
16 35654893
17 35663887
18 35801354
19 35875087
20 38404259
21 38860337
22 38905477
23 39627197
24 39995657
25 39996042
26 40272713
27 40468139

List of values

[6475341, 13214509, 17900677, 19998021, 25747725, 26429018, 26640937, 27321991, 27404041, 27492775, 27820465, 28475829, 28475875, 28803235, 31947953, 35654893, 35663887, 35801354, 35875087, 38404259, 38860337, 38905477, 39627197, 39995657, 39996042, 40272713, 40468139]

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

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