142129

Appears in sequences

• a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2.at n=26A006498
• Squared Fibonacci numbers: a(n) = F(n)^2 where F = A000045.at n=14A007598
• Squares of odd Fibonacci numbers.at n=9A014728
• a(n) = (11*n + 3)^2.at n=34A017426
• a(n) = (12*n + 5)^2.at n=31A017582
• a(n) = Fibonacci(2n)^2.at n=7A049684
• Lesser of twin numbers (differing by 1) of the form F(i)^2 + F(j)^3 (A045704), where F() are Fibonacci numbers.at n=21A063907
• Partial sums of A001654, or sum of the areas of the first n Fibonacci rectangles.at n=13A064831
• a(n)-1, a(n) and a(n)+1 form three consecutive integers that can be factored into Fibonacci numbers.at n=15A065885
• a(n) = Sum_{i = 0..floor(n/2)} (-1)^(i + floor(n/2)) F(2*i + e), where F = A000045 (Fibonacci numbers) and e = (1-(-1)^n)/2.at n=27A074677
• Antidiagonal sums of triangle A035317.at n=25A080239
• 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=24A097083
• a(n) = a(n-1) + a(n-3) + a(n-4) for n > 3, a(0) = -1, a(1) = 1, a(2) = 2, a(3) = 1.at n=27A111569
• Number of derangements of [n] avoiding the patterns 123, 132 and 213.at n=25A114215
• Squares of the form 4*A014574(n-1) + 1.at n=24A131706
• a(n) = (29*n)^2.at n=13A133496
• Product_{k=1..floor((n-1)/2)} (1 + 4*cos(k*Pi/n)^2)*(1 + 4*sin(k*Pi/n)^2).at n=14A152189
• a(n) = Product_{k=1..floor((n-1)/2)} (1 + 4*cos(2*Pi*k/n)^2).at n=28A152192
• a(n) = Fibonacci(n+1)^tau(n).at n=12A168138
• G.f. -x*(x-1)*(1+x)/(1-x-12*x^2-x^3+x^4).at n=10A171069