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.

A216187 Number of labeled rooted trees on n nodes such that each internal node has an odd number of children.

Table of values

n a(n)
0 0
1 1
2 2
3 6
4 28
5 200
6 1926
7 22512
8 306104
9 4770432
10 84234250
11 1663735040
12 36320155092
13 867963393024
14 22535294920334
15 631718010255360
16 19016907901995376
17 611869203759792128
18 20954324710009221138
19 761015341362413371392
20 29214930870257449355660

List of values

[0, 1, 2, 6, 28, 200, 1926, 22512, 306104, 4770432, 84234250, 1663735040, 36320155092, 867963393024, 22535294920334, 631718010255360, 19016907901995376, 611869203759792128, 20954324710009221138, 761015341362413371392, 29214930870257449355660]

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

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