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.
%I A052006 #24 Oct 27 2018 21:56:21
%S A052006 17,30,43,53,66,79,89,102,115,125,138,151,161,174,187,200,210,223,236,
%T A052006 246,259,272,282,295,308,321,331,344,357,367,380,393,403,416,429,442,
%U A052006 452,465,478,488,501,514,524,537,550,560,573,586,599,609,622,635,645
%N A052006 Numbers k for which Fibonacci(k) is the first member of a 1,1 pair (A052005).
%C A052006 Keep adding the terms of sequence A052005 up to the first member of the next 1,1 pair to yield the terms of this sequence. - _Patrick De Geest_
%C A052006 Those k for which F(k-1) < 2^(floor(log_2(F(k)))) and F(k+1) >= 2^(floor(log_2(F(k)))+1) and F(k+2) >= 2^(floor(log_2(F(k)))+2).
%H A052006 Vincenzo Librandi, <a href="/A052006/b052006.txt">Table of n, a(n) for n = 0..1650</a>
%t A052006 With[{F = Fibonacci}, Reap[For[n=0, n<1000, n++, If[F[n-1] < 2^Floor[Log[2, F[n]]] && F[n+1] >= 2^(Floor[Log[2, F[n]]]+1) && F[n+2] >= 2^(Floor[Log[ 2, F[n]]]+2), Print[n]; Sow[n]]]][[2, 1]]] (* _Jean-François Alcover_, Feb 27 2016 *)
%Y A052006 The first differences are A051392.
%Y A052006 Cf. A052005, A000045, A050815, A036284, A037093.
%K A052006 nonn,base,nice
%O A052006 0,1
%A A052006 _Antti Karttunen_ and _Patrick De Geest_, Nov 15 1999