5628750625
domain: N
Appears in sequences
- Squared Fibonacci numbers: a(n) = F(n)^2 where F = A000045.at n=25A007598
- Squares of odd Fibonacci numbers.at n=16A014728
- a(n)-1, a(n) and a(n)+1 form three consecutive integers that can be factored into Fibonacci numbers.at n=26A065885
- a(n) = (Lucas(4*n+2) + 2)/5, or Fibonacci(2*n+1)^2, or A081067(n)/5.at n=12A081068
- a(n)= 3*a(n-1) -3*a(n-3) +a(n-4), n>6.at n=26A107840
- Numbers k such that k divides Fibonacci(k) with multiples of 12 excluded.at n=23A129066
- A product of consecutive doubled Fibonacci numbers.at n=25A166516
- 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=24A208176
- 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=14A264085
- Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 0,2 or 1,1.at n=14A264106
- 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=22A301960
- a(n) is the denominator of the square of the n-th Lagrange number.at n=29A382099