login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049997 a(n) = n-th number of the form F(i)*F(j), when these Fibonacci-products are arranged in order without duplicates. 5
0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 13, 15, 16, 21, 24, 25, 26, 34, 39, 40, 42, 55, 63, 64, 65, 68, 89, 102, 104, 105, 110, 144, 165, 168, 169, 170, 178, 233, 267, 272, 273, 275, 288, 377, 432, 440, 441, 442, 445, 466, 610, 699, 712, 714, 715, 720, 754 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

MATHEMATICA

Take[ Union@Flatten@Table[ Fibonacci[i]Fibonacci[j], {i, 0, 16}, {j, 0, i}], 61] (from Robert G. Wilson v (rgwv(at)rgwv.com), Dec 14 2005)

CROSSREFS

See A049998 for further information about this sequence. Cf. A080097.

Sequence in context: A052347 A193299 A022773 * A039170 A097624 A000398

Adjacent sequences:  A049994 A049995 A049996 * A049998 A049999 A050000

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 12 13:12 EST 2012. Contains 205403 sequences.