login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
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 (list; graph; refs; listen; history; text; internal format)
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 A259896

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 20:17 EST 2021. Contains 349425 sequences. (Running on oeis4.)