68032

Appears in sequences

• a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=0; also a(n) = T(2n,n).at n=7A026387
• T(n,[ n/2 ]), where T is the array in A026386.at n=15A026392
• a(0)=1; for n>0, a(n) = 2*5^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).at n=8A085362
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k peaks at odd height.at n=46A101894
• Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial transform. Same as interpolating bilateral Schroeder paths (A026375) with the central binomial coefficients (A000984).at n=37A163841
• a(n) = Sum_{k=0..n} binomial(2*n, n-k) * p(k), where p(k) is the partition function A000041.at n=8A356280