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.

A317059 a(n) is the number of time-dependent assembly trees satisfying the edge gluing rule for a complete graph on n vertices.

Table of values

n a(n)
1 1
2 1
3 3
4 21
5 255
6 4815
7 130095
8 4763115
9 226955925
10 13646570175
11 1010560060125
12 90363456777825
13 9599238270346725
14 1194935000536101825
15 172283712268118826375
16 28481473075454845070625
17 5351643310498951112521875
18 1134140509146174954631081875
19 269235074280949277622074328375

List of values

[1, 1, 3, 21, 255, 4815, 130095, 4763115, 226955925, 13646570175, 1010560060125, 90363456777825, 9599238270346725, 1194935000536101825, 172283712268118826375, 28481473075454845070625, 5351643310498951112521875, 1134140509146174954631081875, 269235074280949277622074328375]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.