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!)
A244404 Number of unlabeled rooted trees with n nodes and maximal outdegree (branching factor) 8. 2
1, 2, 6, 17, 50, 143, 416, 1199, 3473, 10042, 29089, 84259, 244316, 708679, 2057087, 5974077, 17359390, 50467157, 146789962, 427148444, 1243513350, 3621591235, 10551595959, 30753712080, 89666493709, 261522175986, 763002239120, 2226771020793, 6500575182332 (list; graph; refs; listen; history; text; internal format)
OFFSET
9,2
LINKS
MAPLE
b:= proc(n, i, t, k) option remember; `if`(n=0, 1,
`if`(i<1, 0, add(binomial(b((i-1)$2, k$2)+j-1, j)*
b(n-i*j, i-1, t-j, k), j=0..min(t, n/i))))
end:
a:= n-> b(n-1$2, 8$2) -`if`(k=0, 0, b(n-1$2, 7$2)):
seq(a(n), n=9..40);
MATHEMATICA
b[n_, i_, t_, k_] := b[n, i, t, k] = If[n == 0, 1, If[i < 1, 0, Sum[Binomial[b[i - 1, i - 1, k, k] + j - 1, j]* b[n - i*j, i - 1, t - j, k], {j, 0, Min[t, n/i]}]] // FullSimplify] ; a[n_] := b[n - 1, n - 1, 8, 8] - If[n == 0, 0, b[n - 1, n - 1, 7, 7]]; Table[a[n], {n, 9, 40}] (* Jean-François Alcover, Feb 09 2015, after Maple *)
CROSSREFS
Column k=8 of A244372.
Sequence in context: A244401 A244402 A244403 * A244405 A244406 A244407
KEYWORD
nonn
AUTHOR
Joerg Arndt and Alois P. Heinz, Jun 27 2014
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 March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)