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.

A127532 Triangle read by rows: T(n,k) is the number of binary trees with n edges and jump-length equal to k (n >= 0, 0 <= k <= n-2).

Table of values

n a(n)
0 1
1 2
2 5
3 12
4 2
5 29
6 9
7 4
8 70
9 32
10 22
11 8
12 169
13 102
14 86
15 56
16 16
17 408
18 306
19 296
20 244
21 144
22 32
23 985
24 883
25 949
26 901
27 712
28 368
29 64
30 2378
31 2480
32 2908
33 3056
34 2822
35 2096
36 928
37 128
38 5741
39 6828
40 8633
41 9830
42 10074
43 8976
44 6144
45 2304
46 256
47 13860
48 18514
49 25032
50 30482
51 33792

List of values

[1, 2, 5, 12, 2, 29, 9, 4, 70, 32, 22, 8, 169, 102, 86, 56, 16, 408, 306, 296, 244, 144, 32, 985, 883, 949, 901, 712, 368, 64, 2378, 2480, 2908, 3056, 2822, 2096, 928, 128, 5741, 6828, 8633, 9830, 10074, 8976, 6144, 2304, 256, 13860, 18514, 25032, 30482, 33792]