372100

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=28A006498
• Squared Fibonacci numbers: a(n) = F(n)^2 where F = A000045.at n=15A007598
• Squares of even Fibonacci numbers.at n=5A014729
• Lesser of twin numbers (differing by 1) of the form F(i)^2 + F(j)^3 (A045704), where F() are Fibonacci numbers.at n=23A063907
• a(n)-1, a(n) and a(n)+1 form three consecutive integers that can be factored into Fibonacci numbers.at n=16A065885
• 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=29A074677
• a(n) = (Lucas(4*n+2) + 2)/5, or Fibonacci(2*n+1)^2, or A081067(n)/5.at n=7A081068
• Squares of second pentagonal numbers: a(n) = (1/4)*n^2*(3*n+1)^2.at n=20A100256
• a(n)= 3*a(n-1) -3*a(n-3) +a(n-4), n>6.at n=16A107840
• 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=29A111569
• Number of derangements of [n] avoiding the patterns 123, 132 and 213.at n=27A114215
• Three consecutive elements of the sequence built from a quadratic form over four consecutive Fibonacci numbers A000045.at n=11A114695
• Squares whose digit reversal is a brilliant number (A078972).at n=26A115667
• a(n) = Product_{k=1..floor((n-1)/2)} (1 + 4*cos(2*Pi*k/n)^2).at n=30A152192
• A product of consecutive doubled Fibonacci numbers.at n=15A166516
• Squares that are a sum of two Fibonacci numbers plus the square of a Fibonacci number.at n=35A179459
• 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=27A195971
• Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=10A207369
• a(n) = F(n+1)^2, if n>=0 is even (F=A000045) and a(n) = (L(2n+2)+8)/5, if n is odd (L=A000204).at n=14A208176
• Squares equal to the difference between two successive primes of the form n^2+1.at n=18A216330