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.

A214570 a(n) = Max(c(t)), where c(t) is the number of ordered trees isomorphic - as rooted trees - to the rooted tree t and the maximum is taken over all rooted trees with n vertices.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 3
6 4
7 6
8 12
9 24
10 40
11 60
12 120
13 240
14 420
15 840
16 1680

List of values

[1, 1, 1, 2, 3, 4, 6, 12, 24, 40, 60, 120, 240, 420, 840, 1680]

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

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