67064

Appears in sequences

• a(n) is the number of words of length 2n in the language F, the language of "parity-constrained-shuffle of well-parenthesized words".at n=7A116456
• Number of binary strings of length n with no substrings equal to 0001, 0100, or 1110.at n=22A164468
• Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four or five distinct values for every i,j,k<=n.at n=14A211526
• Number of Motzkin n-paths avoiding even-numbered steps that are flat steps.at n=17A214938
• a(n) = A214938(2n+1).at n=8A291091