61360

Appears in sequences

• If n < 8 then A058966(n), else n*2^(n - 3) - 2*n - 50.at n=12A058967
• Gray code of Fibonacci(n).at n=24A255919
• T(n, k) = [x^n] 2^n*P(n, x), where P(n, x) = (1 + 4*x)^(n + 1) + (1 - 2^(-2*n-1))*(2 + 4*x)^(n + 1). Triangle read by rows, T(n, k) for 0 <= k <= n+1 if n >= 0 and by convention T(-1, 0) = 0.at n=19A342317