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.

A063090 a(n)/(n*n!) is the average number of comparisons needed to find a node in a binary search tree containing n nodes inserted in a random order.

Table of values

n a(n)
1 1
2 6
3 34
4 212
5 1488
6 11736
7 103248
8 1004832
9 10733760
10 124966080
11 1575797760
12 21403457280
13 311623441920
14 4842481190400
15 80007869491200
16 1400671686758400
17 25902542427955200
18 504597366114508800
19 10328835149402112000

List of values

[1, 6, 34, 212, 1488, 11736, 103248, 1004832, 10733760, 124966080, 1575797760, 21403457280, 311623441920, 4842481190400, 80007869491200, 1400671686758400, 25902542427955200, 504597366114508800, 10328835149402112000]

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

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