821223649

Appears in sequences

• Squared Fibonacci numbers: a(n) = F(n)^2 where F = A000045.at n=23A007598
• Squares of odd Fibonacci numbers.at n=15A014728
• a(n)-1, a(n) and a(n)+1 form three consecutive integers that can be factored into Fibonacci numbers.at n=24A065885
• a(n) = (Lucas(4*n+2) + 2)/5, or Fibonacci(2*n+1)^2, or A081067(n)/5.at n=11A081068
• a(n)= 3*a(n-1) -3*a(n-3) +a(n-4), n>6.at n=24A107840
• Three consecutive elements of the sequence built from a quadratic form over four consecutive Fibonacci numbers A000045.at n=17A114695
• A product of consecutive doubled Fibonacci numbers.at n=23A166516
• 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=22A208176
• Primonacci numbers: composite numbers that appear in the Fibonacci-like sequence generated by their own prime factors.at n=21A212875
• Number of 2 X n arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor.at n=11A221088
• Number of (2+1) X (n+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=14A264018
• Number of nX4 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=20A301960
• a(n) is the denominator of the square of the n-th Lagrange number.at n=23A382099