18215019649domain: NAppears in sequencesa(n) = F(n+1)^2 + F(n+1)*F(n) - F(n)^2, where F = A000045.at n=25A236428Numbers w such that (F(2*n-1)^2, -F(2*n)^2, w) are primitive solutions of the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 1, where F(n) is the n-th Fibonacci number (A000045).at n=12A337929