login
Let T be the sequence Fibonacci(2n+1), n>=0 (cf. A001519); sequence lists the differences T(j)-T(i) for i<j.
4

%I #4 Aug 30 2015 14:11:39

%S 1,3,4,8,11,12,21,29,32,33,55,76,84,87,88,144,199,220,228,231,232,377,

%T 521,576,597,605,608,609,987,1364,1508,1563,1584,1592,1595,1596,2584,

%U 3571,3948,4092,4147,4168,4176,4179,4180,6765,9349,10336,10713,10857,10912,10933

%N Let T be the sequence Fibonacci(2n+1), n>=0 (cf. A001519); sequence lists the differences T(j)-T(i) for i<j.

%C See Comments in A169691.

%t Module[{nn=31,fbs},fbs=Fibonacci[Range[1,nn,2]];Sort[Flatten[Table[ fbs[[n]]- Take[fbs,n-1],{n,nn/2}]]]] (* _Harvey P. Dale_, Aug 30 2015 *)

%Y Cf. A000045, A001519, A169690, A169692, A169693, A169677-A169680.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Apr 14 2010