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.

A339779 Array read by antidiagonals: T(n,k) is the number of homeomorphically irreducible leaf colored trees with n leaves of k colors.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 1
9 0
10 1
11 3
12 3
13 1
14 0
15 1
16 4
17 6
18 4
19 2
20 0
21 1
22 5
23 10
24 10
25 11
26 3
27 0
28 1
29 6
30 15
31 20
32 36
33 30
34 7
35 0
36 1
37 7
38 21
39 35
40 90
41 144
42 105
43 13
44 0
45 1
46 8
47 28
48 56
49 190
50 476
51 706
52 380
53 32
54 0
55 1
56 9
57 36
58 84
59 357
60 1251
61 3034
62 3774
63 1555
64 73
65 0
66 1
67 10
68 45
69 120
70 616
71 2814
72 9845
73 21380
74 22140
75 6650
76 190
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 3, 1, 0, 1, 4, 6, 4, 2, 0, 1, 5, 10, 10, 11, 3, 0, 1, 6, 15, 20, 36, 30, 7, 0, 1, 7, 21, 35, 90, 144, 105, 13, 0, 1, 8, 28, 56, 190, 476, 706, 380, 32, 0, 1, 9, 36, 84, 357, 1251, 3034, 3774, 1555, 73, 0, 1, 10, 45, 120, 616, 2814, 9845, 21380, 22140, 6650, 190, 0]