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.

A349409 Triangle read by rows: T(n,k) is the number of planar tanglegrams of size n with 0 <= k < n leaf-matched pairs. A leaf matched pair is a pair of non-leaf vertices (u,v) in the tanglegram such that the induced subtrees rooted and u and v also form a tanglegram (equivalently, the leaves in these two subtrees are matched by the matching that forms the original tanglegram).

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 0
8 5
9 4
10 2
11 0
12 34
13 28
14 11
15 3
16 0
17 273
18 239
19 102
20 29
21 6
22 0
23 2436
24 2283
25 1045
26 325
27 73
28 11
29 0
30 23391
31 23475
32 11539
33 3852
34 968
35 181
36 23
37 0
38 237090
39 254309
40 133690
41 47640
42 12923
43 2756
44 444
45 46
46 0
47 2505228
48 2864283
49 1605280
50 607743
51 175976
52 40903
53 7650
54 1085
55 98

List of values

[1, 0, 1, 0, 1, 1, 0, 5, 4, 2, 0, 34, 28, 11, 3, 0, 273, 239, 102, 29, 6, 0, 2436, 2283, 1045, 325, 73, 11, 0, 23391, 23475, 11539, 3852, 968, 181, 23, 0, 237090, 254309, 133690, 47640, 12923, 2756, 444, 46, 0, 2505228, 2864283, 1605280, 607743, 175976, 40903, 7650, 1085, 98]