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.

A318697 Number of ways to partition a hypertree spanning n vertices into hypertrees.

Table of values

n a(n)
1 1
2 1
3 7
4 93
5 1856
6 49753
7 1679441
8 68463769
9 3273695758
10 179710285011
11 11141016392749
12 769939840667473
13 58695964339179805
14 4893452980658819151
15 442915168219228586581
16 43255083632741702266097
17 4533695508041747494704359
18 507638249638364368312476913

List of values

[1, 1, 7, 93, 1856, 49753, 1679441, 68463769, 3273695758, 179710285011, 11141016392749, 769939840667473, 58695964339179805, 4893452980658819151, 442915168219228586581, 43255083632741702266097, 4533695508041747494704359, 507638249638364368312476913]