9096393

Appears in sequences

• a(n) = Fibonacci(n) - 2^(floor(n/2)).at n=35A028892
• a(n) = Fibonacci(n-2) + 2*a(n-2) - (n mod 2).at n=34A192727
• Number of balanced parenthesis expressions of length 2n and depth 3.at n=15A258109
• Number of Dyck paths of semilength 6*n and height n.at n=3A289476
• Number A(n,k) of Dyck paths of semilength k*n and height n; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=48A289481
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 0, a(2) = 1, a(3) = 2.at n=32A295724