login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036375 Number of ternary rooted trees with n nodes and height at most 7. 3
1, 1, 1, 2, 4, 8, 17, 39, 88, 203, 464, 1056, 2381, 5344, 11900, 26381, 58165, 127713, 279209, 608213, 1319985, 2855275, 6155981, 13231553, 28353787, 60583959, 129084369, 274283708, 581244959, 1228514486, 2589902750, 5446168197 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
E. M. Rains and N. J. A. Sloane, On Cayley's Enumeration of Alkanes (or 4-Valent Trees), J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.
FORMULA
If T_i(z) = g.f. for ternary trees of height at most i, T_{i+1}(z)=1+z*(T_i(z)^3/6+T_i(z^2)*T_i(z)/2+T_i(z^3)/3); T_0(z) = 1.
MATHEMATICA
T[0] = {1}; T[n_] := T[n] = Module[{f, g}, f[z_] := Sum[T[n - 1][[i]]*z^(i - 1), {i, 1, Length[T[n - 1]]}]; g = 1 + z*(f[z]^3/6 + f[z^2]*f[z]/2 + f[z^3]/3); CoefficientList[g, z]]; A036375 = T[7] (* Jean-François Alcover, Jan 19 2016, after Alois P. Heinz (A036370) *)
CROSSREFS
Cf. A036370.
Sequence in context: A132043 A055545 A241671 * A036376 A000598 A003008
KEYWORD
nonn,fini,full
AUTHOR
N. J. A. Sloane, E. M. Rains (rains(AT)caltech.edu)
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 11:11 EST 2023. Contains 367690 sequences. (Running on oeis4.)