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.

A200850 The number of forests of labeled rooted strictly binary trees (each vertex has exactly two children or none) on n nodes.

Table of values

n a(n)
0 1
1 1
2 1
3 4
4 13
5 91
6 511
7 5146
8 41329
9 544573
10 5704381
11 93001096
12 1203040741
13 23391560479
14 360416247283
15 8142893840446
16 145661102170081
17 3750604005834361
18 76415186203927129
19 2209120481052933868
20 50510327090854792861
21 1620053085929867956291

List of values

[1, 1, 1, 4, 13, 91, 511, 5146, 41329, 544573, 5704381, 93001096, 1203040741, 23391560479, 360416247283, 8142893840446, 145661102170081, 3750604005834361, 76415186203927129, 2209120481052933868, 50510327090854792861, 1620053085929867956291]

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

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