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.

A342588 T(n,k) is the number of labeled connected posets of n labeled elements with k covering relations (n>=1, k>=0). Triangle read by rows.

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 0
6 12
7 0
8 0
9 0
10 128
11 18
12 0
13 0
14 0
15 0
16 2000
17 960
18 100
19 0
20 0
21 0
22 0
23 0
24 41472
25 43320
26 15000
27 1710
28 140
29 0
30 0
31 0
32 0
33 0
34 0
35 1075648
36 1985760
37 1453200
38 490560
39 90594
40 10080
41 770
42 0
43 0
44 0
45 0
46 0
47 0
48 0
49 33554432
50 96937680
51 122360000
52 82220880
53 32527488
54 8205288
55 1396640
56 179760
57 20048
58 1050

List of values

[1, 0, 2, 0, 0, 12, 0, 0, 0, 128, 18, 0, 0, 0, 0, 2000, 960, 100, 0, 0, 0, 0, 0, 41472, 43320, 15000, 1710, 140, 0, 0, 0, 0, 0, 0, 1075648, 1985760, 1453200, 490560, 90594, 10080, 770, 0, 0, 0, 0, 0, 0, 0, 33554432, 96937680, 122360000, 82220880, 32527488, 8205288, 1396640, 179760, 20048, 1050]