27392682

Appears in sequences

• Square table, read by antidiagonals, where T(n,k) equals the number of k-tournament sequences of length n for k>=1, with T(0,k) = 1 for k>=1 and T(n,1) = 0 for n>0.at n=38A113080
• Square table T, read by antidiagonals, where T(n,k) gives the number of n-th generation descendents of a node labeled (k), in the tree of 3-tournament sequences, for n>=1.at n=38A113081
• Triangle T, read by rows, equal to the matrix square of triangle A113084, which satisfies the recurrence: A113084(n,k) = [A113084^3](n-1,k-1) + [A113084^3](n-1,k).at n=21A113088
• Number of 3-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 2 and t_i = 2 (mod 2) and t_{i+1} <= 3*t_i for 1<i<n.at n=6A113089