Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045704
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045704 Numbers of the form F(i)^2 + F(j)^3, where F() are Fibonacci numbers. +0
2
0, 1, 2, 4, 5, 8, 9, 10, 12, 17, 25, 26, 27, 28, 31, 33, 36, 52, 64, 65, 72, 91, 125, 126, 129, 134, 150, 169, 170, 177, 189, 196, 294, 441, 442, 449, 468, 512, 513, 516, 521, 537, 566, 576, 681, 953, 1156, 1157, 1164, 1183, 1281, 1668, 2197, 2198, 2201, 2206 (list; graph; listen)
OFFSET

1,3

FORMULA

For example, a(6)=9 because 9=2^3+1^2 or 9=0^3+3^2.

MATHEMATICA

f = Table[ Fibonacci[ i ], {i, 0, 25} ]; Take[ Union[ Flatten[ Table[ f[ [ i ] ]^2 + f[ [ j ] ]^3, {i, 1, 26}, {j, 1, 26} ] ] ], 56 ]

CROSSREFS

Cf. A000045.

Adjacent sequences: A045701 A045702 A045703 this_sequence A045705 A045706 A045707

Sequence in context: A131615 A087815 A022549 this_sequence A084581 A121996 A091072

KEYWORD

nonn,easy

AUTHOR

Felice Russo (felice.russo(AT)katamail.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research