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.

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

Table of values

n a(n)
1 1
2 128
3 139968
4 536870912
5 5000000000000
6 92442129447518208
7 2988151979474457198592
8 154742504910672534362390528
9 12044329605471552321957641846784
10 1342177280000000000000000000000000000
11 206097683218942123873399068932507659403264
12 42281678783395138381516145098915043145456549888

List of values

[1, 128, 139968, 536870912, 5000000000000, 92442129447518208, 2988151979474457198592, 154742504910672534362390528, 12044329605471552321957641846784, 1342177280000000000000000000000000000, 206097683218942123873399068932507659403264, 42281678783395138381516145098915043145456549888]

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

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