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.

A210654 Triangle read by rows: T(n,k) (1 <= k <= n) = number of irreducible coverings by edges of the complete bipartite graph K_{n,k}.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 6
6 15
7 1
8 14
9 48
10 184
11 1
12 30
13 165
14 680
15 2945
16 1
17 62
18 558
19 2664
20 13080
21 63756
22 1
23 126
24 1827
25 11032
26 59605
27 320292
28 1748803
29 1
30 254
31 5820
32 46904
33 281440
34 1663248
35 9791824
36 58746304
37 1
38 510
39 18177
40 200232
41 1379745
42 8906544
43 56499849
44 361679040
45 2361347073

List of values

[1, 1, 2, 1, 6, 15, 1, 14, 48, 184, 1, 30, 165, 680, 2945, 1, 62, 558, 2664, 13080, 63756, 1, 126, 1827, 11032, 59605, 320292, 1748803, 1, 254, 5820, 46904, 281440, 1663248, 9791824, 58746304, 1, 510, 18177, 200232, 1379745, 8906544, 56499849, 361679040, 2361347073]