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

%I #5 Aug 01 2014 12:36:23

%S 3,23,114,474,1780,6179,20363,64441,197653,591131,1732165,4989933,

%T 14171244,39760411,110402589,303808762,829504935,2249326273,

%U 6062516975,16252409052,43361162336,115191492778,304834916107,803891596292,2113302899765,5539657831304

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

%H Alois P. Heinz, <a href="/A245752/b245752.txt">Table of n, a(n) for n = 25..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, 7$2) -b(n-1$2, 6$2):

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

%Y Column k=7 of A244523.

%K nonn

%O 25,1

%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 April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)