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!)
A244402 Number of unlabeled rooted trees with n nodes and maximal outdegree (branching factor) 6. 2
1, 2, 6, 17, 50, 143, 415, 1192, 3444, 9931, 28687, 82857, 239563, 692878, 2005381, 5806915, 16824277, 48767953, 141430699, 410341703, 1191064873, 3458607705, 10046993035, 29196507434, 84874753458, 246814998803, 717965190047, 2089140528083, 6080768466919 (list; graph; refs; listen; history; text; internal format)
OFFSET
7,2
LINKS
FORMULA
a(n) = A036722(n) - A036721(n).
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, 6$2) -`if`(k=0, 0, b(n-1$2, 5$2)):
seq(a(n), n=7..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, 6, 6] - If[n == 0, 0, b[n - 1, n - 1, 5, 5]]; Table[a[n], {n, 7, 40}] (* Jean-François Alcover, Feb 09 2015, after Maple *)
CROSSREFS
Column k=6 of A244372.
Sequence in context: A148445 A148446 A244401 * A244403 A244404 A244405
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 April 18 11:02 EDT 2024. Contains 371779 sequences. (Running on oeis4.)