2785525domain: NAppears in sequencesNumber T(n,k) of sequences in {1,...,n}^n with longest increasing subsequence of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=51A245667Number of sequences in {1,...,n}^n with longest increasing subsequence of length six.at n=3A268873