321590

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=8A026387
• T(n,[ n/2 ]), where T is the array in A026386.at n=17A026392
• Self-convolution of array T given by A026374.at n=9A026946
• Self-convolution of array T given by A026386.at n=9A026951
• 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=9A085362
• 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=56A101894