The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #11 Jan 30 2020 22:02:43
%S 1,3,37,596,11513,245356,5597060,133950215,3323281496,84787933926,
%T 2212123329500,58779046239904,1585796125188065,43337540217740908,
%U 1197492197496481744,33406620056723507124,939775084670916268134,26632926871927867655261,759732892913483065912296
%N Number of rooted trees with 2-colored non-root nodes with an n nodes of each color.
%C The total number of nodes including the root is 2n + 1.
%H Andrew Howroyd, <a href="/A331114/b331114.txt">Table of n, a(n) for n = 0..100</a>
%F a(n) = A304489(2*n+1, n).
%e a(1) = 3 because there are three trees with one root node and one additional node of each color:
%e 1 -- o -- 2,
%e o -- 1 -- 2,
%e o -- 2 -- 1.
%Y Cf. A304489, A329055, A331113.
%K nonn
%O 0,2
%A _Andrew Howroyd_, Jan 09 2020