|
%I #34 Feb 12 2014 12:01:38
%S 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 89,102,104,105,110,144,165,168,169,170,178,233,267,272,273,275,288,
%U 377,432,440,441,442,445,466,610,699,712,714,715,720,754
%N Numbers of the form Fibonacci(i)*Fibonacci(j).
%C It follows from Atanassov et al. that a(n) << sqrt(phi)^n, which matches the trivial a(n) >> sqrt(phi)^n up to a constant factor. - _Charles R Greathouse IV_, Feb 06 2013
%H Charles R Greathouse IV, <a href="/A049997/b049997.txt">Table of n, a(n) for n = 0..10000</a>
%H K. T. Atanassov, Ron Knott, Kiyota Ozeki, A. G. Shannon, and László Szalay, <a href="http://www.fq.math.ca/Scanned/41-1/atanassov.pdf">Inequalities among related pairs of Fibonacci numbers</a>, Fibonacci Quarterly 41:1 (2003), pp. 20-22.
%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 25 is in the sequence since it is the product of two, not necessarily distinct, Fibonacci numbers, 5 and 5.
%e 26 is in the sequence since it is the product of two Fibonacci numbers, 2 and 13.
%e 27 is not in the sequence because there is no way whatsoever to represent it as the product of exactly two Fibonacci numbers.
%t Take[ Union@Flatten@Table[ Fibonacci[i]Fibonacci[j], {i, 0, 16}, {j, 0, i}], 61] (* _Robert G. Wilson v_, Dec 14 2005 *)
%o (PARI) list(lim)=my(phi=(1+sqrt(5))/2, v=vector(log(lim*sqrt(5))\log(phi), i, fibonacci(i+1)), u=List([0]),t); for(i=1,#v,for(j=i,#v,t=v[i]*v[j];if(t>lim,break,listput(u,t)))); vecsort(Vec(u),,8) \\ _Charles R Greathouse IV_, Feb 05 2013
%Y Subsequence of A065108; apart from the first term, subsequence of A094563. Complement is A228523.
%Y See A049998 for further information about this sequence. Cf. A080097.
%Y Intersection with A059389 (sums of two Fibonacci numbers) is A226857.
%Y Cf. also A090206, A005478.
%K nonn,easy
%O 0,3
%A _Clark Kimberling_
|
