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!)
A169691 Let T be the sequence Fibonacci(2n+1), n>=0 (cf. A001519); sequence lists the differences T(j)-T(i) for i<j. 4
1, 3, 4, 8, 11, 12, 21, 29, 32, 33, 55, 76, 84, 87, 88, 144, 199, 220, 228, 231, 232, 377, 521, 576, 597, 605, 608, 609, 987, 1364, 1508, 1563, 1584, 1592, 1595, 1596, 2584, 3571, 3948, 4092, 4147, 4168, 4176, 4179, 4180, 6765, 9349, 10336, 10713, 10857, 10912, 10933 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

See Comments in A169691.

LINKS

Table of n, a(n) for n=1..52.

MATHEMATICA

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 *)

CROSSREFS

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

Sequence in context: A004014 A243177 A113294 * A255748 A152412 A287404

Adjacent sequences:  A169688 A169689 A169690 * A169692 A169693 A169694

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Apr 14 2010

STATUS

approved

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 20 10:03 EDT 2021. Contains 345162 sequences. (Running on oeis4.)