10020010

Appears in sequences

• a(n) = maximal value of C(i, j) * C(n-j, n-i) for 0 <= j <= i <= n.at n=19A094291
• Maximal number of longest common subsequences between any two binary strings of length n (Version 1).at n=19A094837
• A lower bound for A094837.at n=19A171003
• Binomial(n-k-1,k) * binomial(n-k,k+1) where k = ceiling(n/4).at n=20A171006