45236404

Appears in sequences

• 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 4-tournament sequences.at n=29A113092
• Triangle T, read by rows, that satisfies the recurrence: T(n,k) = [T^4](n-1,k-1) + [T^4](n-1,k) for n>k>=0, with T(n,n)=1 for n>=0, where T^4 is the matrix 4th power of T.at n=21A113095
• Number of 4-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 1 and t_i = 1 (mod 3) and t_{i+1} <= 4*t_i for 1<i<n.at n=6A113096
• Triangle T, read by rows, equal to the matrix 4th power of triangle A113095, which satisfies the recurrence: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k).at n=15A113101