cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A169690 #4 Jun 18 2012 10:27:28
%S A169690 2,5,7,13,18,20,34,47,52,54,89,123,136,141,143,233,322,356,369,374,
%T A169690 376,610,843,932,966,979,984,986,1597,2207,2440,2529,2563,2576,2581,
%U A169690 2583,4181,5778,6388,6621,6710,6744,6757,6762,6764,10946,15127,16724,17334,17567
%N A169690 Let S be the sequence Fibonacci(2n), n>0 (cf. A001906); sequence lists the differences S(j)-S(i) for i<j.
%C A169690 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 A169690 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 A169690 Cf. A000045, A001906, A169691, A169692, A169693, A169694, A169677-A169680.
%K A169690 nonn
%O A169690 1,1
%A A169690 _N. J. A. Sloane_, Apr 14 2010