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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000418 Number of n-node rooted trees of height 7.
(Formerly M4408 N1862)
2
0, 0, 0, 0, 0, 0, 0, 1, 7, 34, 136, 487, 1615, 5079, 15349, 45009, 128899, 362266, 1002681, 2740448, 7411408, 19865445, 52840977, 139624510, 366803313, 958696860, 2494322662, 6463281890, 16686206047, 42935345688, 110142163940, 281763465941 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,9
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.
FORMULA
MAPLE
For Maple program see link in A000235.
MATHEMATICA
b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 1 || k < 1, 0, Sum[ Binomial[b[i - 1, i - 1, k - 1] + j - 1, j]*b[n - i*j, i - 1, k], {j, 0, n/i}]]]; a[n_] := b[n - 1, n - 1, 7] - b[n - 1, n - 1, 6]; Array[a, 40] (* Jean-François Alcover, Feb 08 2016, after Alois P. Heinz in A034781 *)
CROSSREFS
Column h=7 of A034781.
Sequence in context: A036632 A036639 A036646 * A055852 A319405 A122611
KEYWORD
nonn
AUTHOR
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 April 18 16:22 EDT 2024. Contains 371780 sequences. (Running on oeis4.)