407808

Appears in sequences

• a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=a(3)=2 and a(2)=1.at n=16A024739
• Number of 5 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 0 and 1 1 1 vertically.at n=10A209226
• a(n) = (2*n+1)!*Sum_{k=0..n} B(2*k), B(n) the n-th Bernoulli number.at n=4A260535
• The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1 and a minimal sum (= A282168(n)).at n=17A284432
• Expansion of e.g.f. exp( x * (exp(2 * x) - 1) ).at n=8A351736
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/2)} k^(n-j) * Stirling2(n-j,j)/(n-j)!.at n=63A362839