1012766976domain: NAppears in sequencesa(n) = maximal value of C(i, j) * C(n-j, n-i) for 0 <= j <= i <= n.at n=24A094291Maximal number of longest common subsequences between any two binary strings of length n (Version 1).at n=24A094837Binomial(n-k,k)^2 where k = ceiling(n/4).at n=25A171001A lower bound for A094837.at n=24A171003