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.

A122085 Triangle read by rows: T(n,k) = number of unlabeled free bicolored trees with n nodes (n >= 1) and k (1 <= k <= n-1, except k=0 or 1 if n=1, k=1 if n=2) nodes of one color and n-k nodes of the other color (the colors are not interchangeable).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 2
11 2
12 1
13 1
14 2
15 4
16 2
17 1
18 1
19 3
20 7
21 7
22 3
23 1
24 1
25 3
26 10
27 14
28 10
29 3
30 1
31 1
32 4
33 14
34 28
35 28
36 14
37 4
38 1
39 1
40 4
41 19
42 45
43 65
44 45
45 19
46 4
47 1
48 1
49 5
50 24
51 73
52 132
53 132
54 73
55 24
56 5
57 1
58 1
59 5
60 30
61 105
62 242
63 316
64 242
65 105
66 30
67 5
68 1
69 1
70 6
71 37
72 152
73 412
74 693
75 693
76 412
77 152

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 4, 2, 1, 1, 3, 7, 7, 3, 1, 1, 3, 10, 14, 10, 3, 1, 1, 4, 14, 28, 28, 14, 4, 1, 1, 4, 19, 45, 65, 45, 19, 4, 1, 1, 5, 24, 73, 132, 132, 73, 24, 5, 1, 1, 5, 30, 105, 242, 316, 242, 105, 30, 5, 1, 1, 6, 37, 152, 412, 693, 693, 412, 152]