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.

A007077 Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.

Table of values

n a(n)
1 1
2 4
3 10
4 19
5 31
6 47
7 68
8 92
9 120
10 153
11 190
12 232
13 279
14 332
15 392
16 454
17 521
18 593
19 670
20 753
21 841
22 936
23 1036
24 1141
25 1252
26 1370
27 1494
28 1625
29 1763
30 1909
31 2063
32 2216
33 2376
34 2542
35 2713
36 2890
37 3074
38 3264
39 3460
40 3663
41 3872
42 4088
43 4310
44 4540
45 4776
46 5021

List of values

[1, 4, 10, 19, 31, 47, 68, 92, 120, 153, 190, 232, 279, 332, 392, 454, 521, 593, 670, 753, 841, 936, 1036, 1141, 1252, 1370, 1494, 1625, 1763, 1909, 2063, 2216, 2376, 2542, 2713, 2890, 3074, 3264, 3460, 3663, 3872, 4088, 4310, 4540, 4776, 5021]