login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A297202
Related to label-increasing forests with branching bounded by 4.
7
1, 3, 9, 30, 120, 582, 3351, 22395, 170505, 1457238, 13816869, 143942445, 1634497320, 20093354217, 265873928856, 3767702766825, 56931647539755, 913761523938678, 15524893940956074, 278364926845016820
OFFSET
0,2
COMMENTS
Sequence C_n(3) in Riordan 1978 or 1979.
LINKS
John Riordan, Forests of label-increasing trees, annotated scanned copy of 1978 pre-publication version.
John Riordan, Forests of label-increasing trees, J. Graph Theory, 3 (1979), 127-133.
FORMULA
E.g.f.: F(x)^3, where F(x) is the e.g.f. for A297200. - Max Alekseyev, Jul 12 2019
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 10 2018
EXTENSIONS
Edited and more terms added by Max Alekseyev, Jul 12 2019
STATUS
approved