637065

Appears in sequences

• a(n) = maximal value of C(i, j) * C(n-j, n-i) for 0 <= j <= i <= n.at n=16A094291
• Maximal number of longest common subsequences between any two binary strings of length n (Version 1).at n=16A094837
• Fifth column of triangle A103371 (without leading zeros).at n=8A134287
• A lower bound for A094837.at n=16A171003
• Triangle read by rows. T(n, k) = (n - k + 1) * binomial(n + k + 1, 2*k)^2 / (n + k + 1).at n=40A370233