%I
%S 1,2,1,0,1,1,0,0,1,2,1,0,1,0,0,0,0,1,0,0,0,0,0,0,0,1,1,1,1,0,0,1,0,1,
%T 0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,
%U 0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0
%N 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.
%e a(9)=2 because 9=2^3+1^2 and 9=0^3+3^2
%t f = Prepend[ Table[ Fibonacci[ i ], {i, 2, 25} ], 0 ]; g = Sort[ Flatten[ Table[ f[ [ i ] ]^2 + f[ [ j ] ]^3, {i, 1, 25}, {j, 1, 25} ] ] ]; Table[ Count[ g, n ], {n, 0, 91} ]
%Y Cf. A000045.
%K nonn
%O 0,2
%A _Felice Russo_
%E More terms from _Robert G. Wilson v_, Aug 28 2001
%E Further terms from Victoria A Sapko (vsapko(AT)canes.gsw.edu), Oct 02 2003 and _Rick L. Shepherd_, Jul 13 2004
