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.

A331114 Number of rooted trees with 2-colored non-root nodes with an n nodes of each color.

Original entry on oeis.org

1, 3, 37, 596, 11513, 245356, 5597060, 133950215, 3323281496, 84787933926, 2212123329500, 58779046239904, 1585796125188065, 43337540217740908, 1197492197496481744, 33406620056723507124, 939775084670916268134, 26632926871927867655261, 759732892913483065912296
Offset: 0

Views

Author

Andrew Howroyd, Jan 09 2020

Keywords

Comments

The total number of nodes including the root is 2n + 1.

Examples

			a(1) = 3 because there are three trees with one root node and one additional node of each color:
   1 -- o -- 2,
   o -- 1 -- 2,
   o -- 2 -- 1.
		

Crossrefs

Formula

a(n) = A304489(2*n+1, n).