Let S be the sequence Fibonacci(2n), n>0 (cf. A001906); sequence lists the differences S(j)-S(i) for i<j.

A169690

Let S be the sequence Fibonacci(2n), n>0 (cf. A001906); sequence lists the differences S(j)-S(i) for i<j.

Terms

    a(0) =2a(1) =5a(2) =7a(3) =13a(4) =18a(5) =20a(6) =34a(7) =47a(8) =52a(9) =54a(10) =89a(11) =123a(12) =136a(13) =141a(14) =143a(15) =233a(16) =322a(17) =356a(18) =369a(19) =374a(20) =376a(21) =610a(22) =843a(23) =932a(24) =966a(25) =979a(26) =984a(27) =986a(28) =1597a(29) =2207

External references