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.

A338527 Number of spanning trees in the join of the disjoint union of two complete graphs each on n and n+1 vertices with the empty graph on n+1 vertices.

Table of values

n a(n)
1 24
2 13500
3 34420736
4 239148450000
5 3520397039081472
6 94458953432730437824
7 4179422085120000000000000
8 283894102615246085842939590912
9 28059580711858187192007680000000000
10 3870669526565955444680027453177986243584

List of values

[24, 13500, 34420736, 239148450000, 3520397039081472, 94458953432730437824, 4179422085120000000000000, 283894102615246085842939590912, 28059580711858187192007680000000000, 3870669526565955444680027453177986243584]

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

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