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.

A097384 Total number of comparisons to find each of the values 1 through n using a binary search with 3-way comparisons (less than, equal and greater than), always choosing the mid-most value to compare to.

Table of values

n a(n)
1 0
2 2
3 3
4 6
5 9
6 11
7 13
8 17
9 21
10 25
11 29
12 32
13 35
14 38
15 41
16 46
17 51
18 56
19 61
20 66
21 71
22 76
23 81
24 85
25 89
26 93
27 97
28 101
29 105
30 109
31 113
32 119
33 125
34 131
35 137
36 143
37 149
38 155
39 161
40 167
41 173
42 179
43 185
44 191
45 197
46 203
47 209
48 214
49 219
50 224
51 229
52 234
53 239
54 244
55 249
56 254
57 259
58 264
59 269
60 274

List of values

[0, 2, 3, 6, 9, 11, 13, 17, 21, 25, 29, 32, 35, 38, 41, 46, 51, 56, 61, 66, 71, 76, 81, 85, 89, 93, 97, 101, 105, 109, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 214, 219, 224, 229, 234, 239, 244, 249, 254, 259, 264, 269, 274]