117675360

Appears in sequences

• a(0) = 1; for n > 0, a(n) = binomial(n, floor(n/2)) + binomial(n-1, floor(n/2)).at n=29A050168
• a(n) = C(n)*(3n+2) where C(n) = Catalan numbers = A000108.at n=14A051960
• Number of ways to select 15 knights from n knights sitting at a round table if no adjacent knights are chosen.at n=14A188225