OFFSET
1,2
COMMENTS
This sequence contains A049997 as a subsequence (aside from its first term), so a(n) << sqrt(phi)^n. All Fibonacci factors must be at most the number, so a(n) >> (phi^(1/3))^n. - Charles R Greathouse IV, Feb 06 2013
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
C. Kimberling, Orderings of products of Fibonacci numbers, Fibonacci Quart. 42:1 (2004), pp. 28-35.
EXAMPLE
F(2)*F(2)*F(2) = 1 < F(2)*F(2)*F(3) = 2 < ...
< F(4)*F(4)*F(4) = 27 < F(3)*F(4)*F(5) = 30 < F(3)*F(3)*F(6) = 32 < ...
MATHEMATICA
Select[Union[Times@@@Tuples[Fibonacci[Range[12]], 3]], #<200&] (* Harvey P. Dale, Dec 13 2011 *)
PROG
(PARI) list(lim)=my(phi=(1+sqrt(5))/2, v=vector(log(lim*sqrt(5))\log(phi), i, fibonacci(i+1)), u=List(), t, t1); for(i=1, #v, for(j=i, #v, t1=v[i]*v[j]; if(t1>lim, break); for(k=j, #v, t=t1*v[k]; if(t>lim, break, listput(u, t))))); vecsort(Vec(u), , 8) \\ Charles R Greathouse IV, Feb 06 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 12 2004
STATUS
approved