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.

A000311 Schroeder's fourth problem; also series-reduced rooted trees with n labeled leaves; also number of total partitions of n.

Table of values

n a(n)
0 0
1 1
2 1
3 4
4 26
5 236
6 2752
7 39208
8 660032
9 12818912
10 282137824
11 6939897856
12 188666182784
13 5617349020544
14 181790703209728
15 6353726042486272
16 238513970965257728
17 9571020586419012608
18 408837905660444010496
19 18522305410364986906624

List of values

[0, 1, 1, 4, 26, 236, 2752, 39208, 660032, 12818912, 282137824, 6939897856, 188666182784, 5617349020544, 181790703209728, 6353726042486272, 238513970965257728, 9571020586419012608, 408837905660444010496, 18522305410364986906624]

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

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