|
|
EXAMPLE
| The tree of 4-tournament sequences of descendents
of a node labeled (1) begins:
[1]; generation 1: 1->[4]; generation 2: 4->[7,10,13,16];
generation 3: 7->[10,13,16,19,22,25,28],
10->[13,16,19,22,25,28,31,34,37,40],
13->[16,19,22,25,28,31,34,37,40,43,46,49,52],
16->[19,22,25,28,31,34,37,40,43,46,49,52,55,58,61,64]; ...
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^4)[r-1, c-1])+(M^4)[r-1, c]))); return(M[n+1, 1])}
|
