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.

A318607 Triangle read by rows: T(n,k) is the number of sets of rooted hypertrees on a total of n unlabeled nodes with a total of k edges, (0 <= k < n).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 2
7 1
8 3
9 6
10 4
11 1
12 4
13 12
14 16
15 9
16 1
17 5
18 20
19 42
20 46
21 20
22 1
23 6
24 30
25 86
26 145
27 128
28 48
29 1
30 7
31 42
32 153
33 353
34 483
35 364
36 115
37 1
38 8
39 56
40 248
41 729
42 1369
43 1592
44 1029
45 286
46 1
47 9
48 72
49 376
50 1345
51 3236
52 5150
53 5151
54 2930
55 719
56 1
57 10
58 90
59 541
60 2287
61 6728
62 13708
63 18792
64 16513
65 8344
66 1842

List of values

[1, 1, 1, 1, 2, 2, 1, 3, 6, 4, 1, 4, 12, 16, 9, 1, 5, 20, 42, 46, 20, 1, 6, 30, 86, 145, 128, 48, 1, 7, 42, 153, 353, 483, 364, 115, 1, 8, 56, 248, 729, 1369, 1592, 1029, 286, 1, 9, 72, 376, 1345, 3236, 5150, 5151, 2930, 719, 1, 10, 90, 541, 2287, 6728, 13708, 18792, 16513, 8344, 1842]