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.

A108643 Number of binary rooted trees with n nodes and internal path length n.

Table of values

n a(n)
0 1
1 1
2 0
3 2
4 0
5 1
6 4
7 0
8 4
9 2
10 8
11 6
12 8
13 8
14 8
15 40
16 4
17 29
18 40
19 52
20 56
21 64
22 116
23 112
24 200
25 86
26 296
27 366
28 360
29 432
30 652
31 800
32 840
33 1470
34 1116
35 2048
36 2356
37 3052
38 3524
39 4220
40 5648
41 6964
42 9660
43 8688
44 14128
45 17024
46 19432
47 23972
48 32784
49 37873
50 44912
51 59672
52 67560
53 93684

List of values

[1, 1, 0, 2, 0, 1, 4, 0, 4, 2, 8, 6, 8, 8, 8, 40, 4, 29, 40, 52, 56, 64, 116, 112, 200, 86, 296, 366, 360, 432, 652, 800, 840, 1470, 1116, 2048, 2356, 3052, 3524, 4220, 5648, 6964, 9660, 8688, 14128, 17024, 19432, 23972, 32784, 37873, 44912, 59672, 67560, 93684]