Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049862
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049862 a(n) = n-th number of the form F(i)*F(j), i<>j, when these products of Fibonacci numbers are ordered without duplicates. +0
3
0, 1, 2, 3, 5, 6, 8, 10, 13, 15, 16, 21, 24, 26, 34, 39, 40, 42, 55, 63, 65, 68, 89, 102, 104, 105, 110, 144, 165, 168, 170, 178, 233, 267, 272, 273, 275, 288, 377, 432, 440, 442, 445, 466, 610, 699, 712, 714, 715, 720, 754, 987, 1131 (list; graph; listen)
OFFSET

0,3

CROSSREFS

Sequence in context: A022826 A053035 A160009 this_sequence A022829 A056837 A001971

Adjacent sequences: A049859 A049860 A049861 this_sequence A049863 A049864 A049865

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research