Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049997
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A049997
%S A049997 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,
%T A049997 89,102,104,105,110,144,165,168,169,170,178,233,267,272,273,275,288,
%U A049997 377,432,440,441,442,445,466,610,699,712,714,715,720,754
%N A049997 a(n) = n-th number of the form F(i)*F(j), when these Fibonacci-products 
               are arranged in order without duplicates.
%t A049997 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)
%Y A049997 See A049998 for further information about this sequence. Cf. A080097.
%Y A049997 Sequence in context: A110495 A052347 A022773 this_sequence A039170 A097624 
               A000398
%Y A049997 Adjacent sequences: A049994 A049995 A049996 this_sequence A049998 A049999 
               A050000
%K A049997 nonn
%O A049997 0,3
%A A049997 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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research