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.

A097383 Minimum 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).

Table of values

n a(n)
1 0
2 2
3 3
4 6
5 8
6 11
7 13
8 17
9 20
10 24
11 27
12 31
13 34
14 38
15 41
16 46
17 50
18 55
19 59
20 64
21 68
22 73
23 77
24 82
25 86
26 91
27 95
28 100
29 104
30 109
31 113
32 119
33 124
34 130
35 135
36 141
37 146
38 152
39 157
40 163
41 168
42 174
43 179
44 185
45 190
46 196
47 201
48 207
49 212
50 218
51 223
52 229
53 234
54 240
55 245
56 251
57 256
58 262
59 267
60 273

List of values

[0, 2, 3, 6, 8, 11, 13, 17, 20, 24, 27, 31, 34, 38, 41, 46, 50, 55, 59, 64, 68, 73, 77, 82, 86, 91, 95, 100, 104, 109, 113, 119, 124, 130, 135, 141, 146, 152, 157, 163, 168, 174, 179, 185, 190, 196, 201, 207, 212, 218, 223, 229, 234, 240, 245, 251, 256, 262, 267, 273]