Number of ways n can be written as a sum of a square of a Fibonacci number and a cube of a Fibonacci number; F(1) = F(2) = 1 are considered the same.

A045706

Number of ways n can be written as a sum of a square of a Fibonacci number and a cube of a Fibonacci number; F(1) = F(2) = 1 are considered the same.

Terms

    a(0) =1a(1) =2a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =0a(8) =1a(9) =2a(10) =1a(11) =0a(12) =1a(13) =0a(14) =0a(15) =0a(16) =0a(17) =1a(18) =0a(19) =0a(20) =0a(21) =0a(22) =0a(23) =0a(24) =0a(25) =1a(26) =1a(27) =1a(28) =1a(29) =0

External references