OFFSET
0,2
COMMENTS
LINKS
M. Cook and M. Kleber, Tournament sequences and Meeussen sequences, Electronic J. Comb. 7 (2000), #R44.
EXAMPLE
The tree of tournament sequences of descendents of a node labeled (3) begins:
[3]; generation 1: 3->[4,5,6]; generation 2: 4->[5,6,7,8],
5->[6,7,8,9,10], 6->[7,8,9,10,11,12]; ...
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, q=2)=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^q)[r-1, c-1])+(M^q)[r-1, c]))); return((M^3)[n+1, 1])}
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Oct 14 2005
STATUS
approved