36453

Appears in sequences

• a(n) is the number of binary strings of length n such that no subsequence of length 4 contains 3 or more ones.at n=18A118647
• Number of times that the numerator of a sum generated from the set 1, 1/2, 1/3,..., 1/n is a Fibonacci number.at n=30A256220
• a(n) = T(n, 4) with T(n, k) = Sum_{d|k} phi(d)*binomial(n - 1 + k/d, k/d).at n=29A327032