6439075

Appears in sequences

• a(n) = (2n)! * Sum_{k=0..n} (-1)^k * binomial(n,k) / (n+k)!.at n=7A006902
• Powers of fourth root of 6 rounded up.at n=35A018062
• Array read by antidiagonals upwards: h(n,k) = number of sequences with n copies each of 1,2,...,k and longest increasing subsequence of length k (n>=1, k>=1).at n=34A047909
• Number T(n,k) of words on {1,1,2,2,...,n,n} with longest increasing subsequence of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=35A267480
• Number of sequences with n copies each of 1,2,...,7 and longest increasing subsequence of length 7.at n=1A268843
• Table read by rows. A statistic of permutations of the multiset {1,1,2,2,...,n,n}.at n=21A358112