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.

A319254 Array read by antidiagonals: T(n,k) is the number of series-reduced rooted trees with n leaves of k colors.

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 3
6 2
7 4
8 6
9 10
10 5
11 5
12 10
13 28
14 40
15 12
16 6
17 15
18 60
19 156
20 170
21 33
22 7
23 21
24 110
25 430
26 948
27 785
28 90
29 8
30 28
31 182
32 965
33 3396
34 6206
35 3770
36 261
37 9
38 36
39 280
40 1890
41 9376
42 28818
43 42504
44 18805
45 766
46 10
47 45
48 408
49 3360
50 21798
51 97775
52 256172
53 301548
54 96180
55 2312

List of values

[1, 2, 1, 3, 3, 2, 4, 6, 10, 5, 5, 10, 28, 40, 12, 6, 15, 60, 156, 170, 33, 7, 21, 110, 430, 948, 785, 90, 8, 28, 182, 965, 3396, 6206, 3770, 261, 9, 36, 280, 1890, 9376, 28818, 42504, 18805, 766, 10, 45, 408, 3360, 21798, 97775, 256172, 301548, 96180, 2312]