|
EXAMPLE
|
The tree of 5-tournament sequences of descendents
of a node labeled (3) begins:
[3]; generation 1: 3->[7,11,15];
generation 2: 7->[11,15,19,23,27,31,35],
11->[15,19,23,27,31,35,39,43,47,51,55],
15->[19,23,27,31,35,39,43,47,51,55,59,63,67,71,75]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
|
|
PROG
|
(PARI) {a(n)=local(M=matrix(n+1, n+1)); for(r=1, n+1, for(c=1, r, M[r, c]=if(r==c, 1, if(c>1, (M^5)[r-1, c-1])+(M^5)[r-1, c]))); return((M^3)[n+1, 1])}
|