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.

A072590 Table T(n,k) giving number of spanning trees in complete bipartite graph K(n,k), read by antidiagonals.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 4
6 1
7 1
8 12
9 12
10 1
11 1
12 32
13 81
14 32
15 1
16 1
17 80
18 432
19 432
20 80
21 1
22 1
23 192
24 2025
25 4096
26 2025
27 192
28 1
29 1
30 448
31 8748
32 32000
33 32000
34 8748
35 448
36 1
37 1
38 1024
39 35721
40 221184
41 390625
42 221184
43 35721
44 1024
45 1
46 1
47 2304
48 139968
49 1404928
50 4050000
51 4050000

List of values

[1, 1, 1, 1, 4, 1, 1, 12, 12, 1, 1, 32, 81, 32, 1, 1, 80, 432, 432, 80, 1, 1, 192, 2025, 4096, 2025, 192, 1, 1, 448, 8748, 32000, 32000, 8748, 448, 1, 1, 1024, 35721, 221184, 390625, 221184, 35721, 1024, 1, 1, 2304, 139968, 1404928, 4050000, 4050000]