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.

A304068 Number of trees on n vertices rooted at an oriented non-edge.

Original entry on oeis.org

0, 0, 1, 4, 14, 45, 140, 424, 1269, 3760, 11080, 32517, 95190, 278154, 811887, 2367973, 6903453, 20120905, 58639016, 170894228, 498084608, 1451899005, 4232957241, 12343454790, 36001675800, 105028397290, 306472665459, 894497511566
Offset: 1

Views

Author

Brendan McKay, May 05 2018

Keywords

Examples

			a(4)=4 is based on the same examples as in A304067, but the oriented edge that spans a leaf with the node at distance 2 in the linear graph may have 2 orientations, so a(4) is one larger than A304067(4).
		

Crossrefs

Cf. A000055 (not rooted), A000106 (rooted at oriented edge)

Formula

A000106(n) + a(n) = A000243(n).