136135

Appears in sequences

• a(1)=a(2)=1, a(n) = (a(n-2)+F(n-2)) * (a(n-1)+F(n-1)) for n > 2 where F(i) is the i-th Fibonacci no.at n=6A096424
• a(n)=(n^5-n-30)/30.at n=21A131211
• Sum of the lengths of the first ascents in all n-length left factors of Dyck paths.at n=17A191782