|
%I #20 Aug 01 2019 20:27:44
%S 1,1,7,21,35,35,21,7,1,49,1029,12005,84035,352947,823543,823543,
%T 17294403,155649627,778248135,2334744405,4202539929,4202539929,
%U 1801088541,21012699645,105063498225,291843050625,486405084375,486405084375,270225046875,64339296875
%N a(n) is the number of shapes of balanced trees with constant branching factor 7 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node.
%H Alois P. Heinz, <a href="/A131893/b131893.txt">Table of n, a(n) for n = 0..400</a>
%H Jeffrey Barnett, <a href="http://notatt.com/btree-shapes.pdf">Counting Balanced Tree Shapes</a>
%F a(0) = a(1) = 1; a(7n+1+m) = (7 choose m) * a(n+1)^m * a(n)^(7-m), where n >= 0 and 0 <= m <= 7.
%p a:= proc(n) option remember; local m, r; if n<2 then 1 else
%p r:= iquo(n-1, 7, 'm'); binomial(7, m) *a(r+1)^m *a(r)^(7-m) fi
%p end:
%p seq(a(n), n=0..50); # _Alois P. Heinz_, Apr 10 2013
%t a[n_, k_] := a[n, k] = Module[{m, r}, If[n < 2 || k == 1, 1, If[k == 0, 0, {r, m} = QuotientRemainder[n - 1, k]; Binomial[k, m]*a[r + 1, k]^m*a[r, k]^(k - m)]]];
%t a[n_] := a[n, 7];
%t Table[a[n], {n, 0, 50}] (* _Jean-François Alcover_, Jun 04 2018, after _Alois P. Heinz_ *)
%Y Cf. A110316, A131889, A131890, A131891, A131892.
%Y Column k=7 of A221857. - _Alois P. Heinz_, Apr 17 2013
%K easy,nonn
%O 0,3
%A _Jeffrey Barnett_, Jul 24 2007
|
