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.

A214565 Sum(M(t)), where summation is over all rooted trees t with n vertices and M(t) is the number of ways to take apart t by sequentially removing terminal edges (see A206494).

Table of values

n a(n)
1 1
2 1
3 3
4 12
5 66
6 426
7 3392
8 30412
9 314994
10 3622332
11 46379994
12 648971940
13 9923253672
14 163720448184
15 2910558776412
16 55341456735744

List of values

[1, 1, 3, 12, 66, 426, 3392, 30412, 314994, 3622332, 46379994, 648971940, 9923253672, 163720448184, 2910558776412, 55341456735744]

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

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