login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A169690 Let S be the sequence Fibonacci(2n), n>0 (cf. A001906); sequence lists the differences S(j)-S(i) for i<j. 7

%I

%S 2,5,7,13,18,20,34,47,52,54,89,123,136,141,143,233,322,356,369,374,

%T 376,610,843,932,966,979,984,986,1597,2207,2440,2529,2563,2576,2581,

%U 2583,4181,5778,6388,6621,6710,6744,6757,6762,6764,10946,15127,16724,17334,17567

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

%C The sequences S and T (see A169691) are a pair of sequences with the property that the differences between the terms of S are disjoint from the differences between the terms of T, thus answering a question posed by S. W. Golomb.

%t nn=30;With[{fib2=Fibonacci[Range[2,nn,2]]},Union[Flatten[Table[ fib2[[n]]- Take[ fib2, n-1],{n,nn/2}]]]] (* _Harvey P. Dale_, Jun 18 2012 *)

%Y Cf. A000045, A001906, A169691, A169692, A169693, A169694, A169677-A169680.

%K nonn

%O 1,1

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 08:51 EDT 2021. Contains 345395 sequences. (Running on oeis4.)