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.

A127530 Triangle read by rows: T(n,k) is the number of binary trees with n edges and k jumps (n >= 0, 0 <= k <= max(0,ceiling(n/2)-1) ).

Table of values

n a(n)
0 1
1 2
2 5
3 12
4 2
5 29
6 13
7 70
8 60
9 2
10 169
11 235
12 25
13 408
14 836
15 184
16 2
17 985
18 2790
19 1046
20 41
21 2378
22 8896
23 5080
24 440
25 2
26 5741
27 27410
28 22164
29 3410
30 61
31 13860
32 82230
33 89440
34 21580
35 900
36 2
37 33461
38 241467
39 340058
40 118714
41 9115
42 85
43 80782
44 696732
45 1233562
46 588952

List of values

[1, 2, 5, 12, 2, 29, 13, 70, 60, 2, 169, 235, 25, 408, 836, 184, 2, 985, 2790, 1046, 41, 2378, 8896, 5080, 440, 2, 5741, 27410, 22164, 3410, 61, 13860, 82230, 89440, 21580, 900, 2, 33461, 241467, 340058, 118714, 9115, 85, 80782, 696732, 1233562, 588952]