393169

Appears in sequences

• 13th-order Fibonacci numbers: a(n) = a(n-1) + ... + a(n-13) with a(1)=...=a(13)=1.at n=28A163551
• a(n) = coefficient of x^n, n >= 0, in A(x) such that: 2 = Sum_{n=-oo..+oo} (-1)^n * x^n * (2*A(x) + x^n)^(2*n+1).at n=6A357232