A113945 - cp's OEIS frontend

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

n	a(n)
1	77
2	154
3	233
4	293
5	308
6	319
7	359
8	367
9	377
10	382
11	423
12	457
13	466
14	551
15	553
16	559
17	571
18	573
19	586
20	616
21	617
22	619
23	623
24	638
25	699
26	713
27	717
28	718
29	734
30	754
31	764
32	813
33	841
34	846
35	849
36	869
37	879
38	905
39	914
40	932
41	1007
42	1051
43	1063
44	1069
45	1102
46	1103
47	1106
48	1115
49	1118
50	1133

[77, 154, 233, 293, 308, 319, 359, 367, 377, 382, 423, 457, 466, 551, 553, 559, 571, 573, 586, 616, 617, 619, 623, 638, 699, 713, 717, 718, 734, 754, 764, 813, 841, 846, 849, 869, 879, 905, 914, 932, 1007, 1051, 1063, 1069, 1102, 1103, 1106, 1115, 1118, 1133]

cp's OEIS Frontend

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

Table of values

List of values