4126647

Appears in sequences

• a(n) = 7*a(n-1) - a(n-2) + 4, with a(0) = 0, a(1) = 5.at n=8A003482
• a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045.at n=17A059840
• a(n) = F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 - F(4) if n even, F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 if n odd, where F(n) is the n-th Fibonacci number (A000045).at n=15A080143
• Positive values of k such that there is exactly one permutation p of (1,2,3,...,k) such that i+p(i) is a Fibonacci number for 1<=i<=k.at n=31A097083
• Numerator of Sum_{k=1..n} 1/(Fibonacci(k)*Fibonacci(k+2)).at n=15A119996
• Numerators b(n) of Pythagorean approximations b(n)/a(n) to 1/2.at n=16A195548
• Number of n X 1 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,3,4 for x=0,1,2,3,4.at n=32A195971
• a(n) = F(n)^2 - F(n-1)^2 or F(n+1) * F(n-2) where F(n) = A000045(n), the Fibonacci numbers.at n=17A226205
• a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = a(1) = 1, a(2) = 0.at n=35A236165
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.at n=9A264085