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.

A339780 Triangle read by rows: T(n,k) is the number of homeomorphically irreducible leaf colored trees with n leaves using exactly k colors.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 1
8 2
9 1
10 0
11 2
12 7
13 9
14 4
15 0
16 3
17 24
18 63
19 68
20 26
21 0
22 7
23 91
24 412
25 812
26 720
27 236
28 0
29 13
30 354
31 2673
32 8512
33 13100
34 9672
35 2752
36 0
37 32
38 1491
39 17571
40 84312
41 199820
42 248904
43 156492
44 39208
45 0
46 73
47 6504
48 117365
49 814184
50 2782970
51 5194580
52 5408620
53 2953792
54 660032

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 2, 7, 9, 4, 0, 3, 24, 63, 68, 26, 0, 7, 91, 412, 812, 720, 236, 0, 13, 354, 2673, 8512, 13100, 9672, 2752, 0, 32, 1491, 17571, 84312, 199820, 248904, 156492, 39208, 0, 73, 6504, 117365, 814184, 2782970, 5194580, 5408620, 2953792, 660032]