login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094564 Triple products of distinct Fibonacci numbers: F(i)F(j)F(k), 2<=i<j<k. 1

%I #9 May 03 2016 14:24:29

%S 6,10,15,16,24,26,30,39,40,42,48,63,65,68,78,80,102,104,105,110,120,

%T 126,130,165,168,170,178,195,204,208,210,267,272,273,275,288,312,315,

%U 330,336,340,432,440,442,445,466,504,510,520,534,544,546,550,699,712,714

%N Triple products of distinct Fibonacci numbers: F(i)F(j)F(k), 2<=i<j<k.

%H Clark Kimberling, <a href="http://www.fq.math.ca/Papers1/42-1/quartkimberling01_2004.pdf">Orderings of products of Fibonacci numbers</a>, Fibonacci Quarterly 42:1 (2004), pp. 28-35.

%e F(2)F(3)F(4)=6 < F(2)F(3)F(5)=10 < F(3)F(4)F(5)=30 < ...

%t With[{nn=30},Take[Union[Times@@@Subsets[Fibonacci[Range[2,nn]],{3}]], 2*nn]] (* _Harvey P. Dale_, Dec 23 2015 *)

%Y Cf. A000045, A094563.

%K nonn

%O 1,1

%A _Clark Kimberling_, May 12 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 23 23:47 EDT 2024. Contains 374575 sequences. (Running on oeis4.)