296100

Appears in sequences

• Number of binary strings of length n with no substrings equal to 0001 0110 or 1000.at n=19A164477
• Triangular array read by rows. T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} whose functional digraph has exactly k nodes such that no nonrecurrent element is mapped into it. n >= 1, 1 <= k <= n.at n=24A231536
• a(n) = Sum_{k=0..n} binomial(n,k)^2 * Stirling2(2*k,k) * Stirling2(2*n-2*k,n-k).at n=5A384471