53134

Appears in sequences

• a(n) = a(n-1) + floor(a(n-2)/2) with a(0)=1, a(1)=2.at n=35A064324
• a(n) = Sum_{k=0..n} Fibonacci(k) + (-1)^k*Fibonacci(k-1).at n=22A097132
• a(n) = 3*Fibonacci(n) + (-1)^n.at n=22A097133
• a(n) = 3*Fibonacci(2*n) + 1.at n=11A097136
• Number of forests of rooted trees with total weight n, where a node at height k has weight 2^k (with root considered to be at height 0).at n=45A115593
• n times n+2 gives the concatenation of two numbers m and m-9.at n=5A116226
• a(n) = 2*prime(n)^2 - 4.at n=37A153480
• a(0)=1, a(1)=4, a(n) = a(n-1) + a(n-2) - 1.at n=22A187893
• Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=6A316178
• Number of nX7 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=2A316182
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=38A316183
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=42A316183