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.

A005175 Number of rooted trees with 5 nodes of disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.

Table of values

n a(n)
1 0
2 0
3 3
4 131
5 1830
6 16990
7 127953
8 851361
9 5231460
10 30459980
11 170761503
12 931484191
13 4979773890
14 26223530970
15 136522672653
16 704553794621
17 3611494269120
18 18415268221960
19 93516225653403
20 473366777478651
21 2390054857197150
22 12043393363764950
23 60590148885015753

List of values

[0, 0, 3, 131, 1830, 16990, 127953, 851361, 5231460, 30459980, 170761503, 931484191, 4979773890, 26223530970, 136522672653, 704553794621, 3611494269120, 18415268221960, 93516225653403, 473366777478651, 2390054857197150, 12043393363764950, 60590148885015753]

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

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