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.

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, 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, 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

Offset

0,2

Links

Table of n, a(n) for n=0..104.

Example

a(9)=2 because 9=2^3+1^2 and 9=0^3+3^2

Mathematica

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} ]

Crossrefs

Cf. A000045.

Sequence in context: A179319 A321916 A257265 * A045634 A141702 A364048

Adjacent sequences: A045703 A045704 A045705 * A045707 A045708 A045709

Keyword

nonn

Author

Felice Russo

Extensions

More terms from Robert G. Wilson v, Aug 28 2001

Further terms from Victoria A Sapko (vsapko(AT)canes.gsw.edu), Oct 02 2003 and Rick L. Shepherd, Jul 13 2004

Status

approved