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!)
A245753 Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 8. 2

%I #4 Aug 01 2014 12:36:28

%S 1,19,113,564,2362,9062,32336,109826,358021,1131089,3480858,10484995,

%T 31012892,90329292,259621691,737665484,2074944123,5785110380,

%U 16003477783,43963346701,120021805899,325835717520,880125679307,2366498068034,6336725620724,16903670460151

%N Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 8.

%H Alois P. Heinz, <a href="/A245753/b245753.txt">Table of n, a(n) for n = 30..800</a>

%p b:= proc(n, i, t, k) option remember; `if`(n=0, 1,

%p `if`(i<1, 0, add(binomial(b(i-1$2, k$2), j)*

%p b(n-i*j, i-1, t-j, k), j=0..min(t, n/i))))

%p end:

%p a:= n-> b(n-1$2, 8$2) -b(n-1$2, 7$2):

%p seq(a(n), n=30..60);

%Y Column k=8 of A244523.

%K nonn

%O 30,2

%A _Joerg Arndt_ and _Alois P. Heinz_, Jul 31 2014

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 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)