766655

Appears in sequences

• Number of ballot sequences of length n having exactly one descent.at n=21A241794
• Zero-avoiding Fibonacci sequence: a(n) is the largest zeroless number that can be written as a(i) + a(j) where 1 <= i < j < n with a(1) = a(2) = 1.at n=30A374924