The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052006 Numbers k for which Fibonacci(k) is the first member of a 1,1 pair (A052005). 3
 17, 30, 43, 53, 66, 79, 89, 102, 115, 125, 138, 151, 161, 174, 187, 200, 210, 223, 236, 246, 259, 272, 282, 295, 308, 321, 331, 344, 357, 367, 380, 393, 403, 416, 429, 442, 452, 465, 478, 488, 501, 514, 524, 537, 550, 560, 573, 586, 599, 609, 622, 635, 645 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS 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 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). LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1650 MATHEMATICA 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 *) CROSSREFS The first differences are A051392. Cf. A052005, A000045, A050815, A036284, A037093. Sequence in context: A146872 A146792 A124884 * A002675 A333855 A321217 Adjacent sequences: A052003 A052004 A052005 * A052007 A052008 A052009 KEYWORD nonn,base,nice AUTHOR Antti Karttunen and Patrick De Geest, Nov 15 1999 STATUS approved

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

Last modified October 3 14:07 EDT 2023. Contains 365866 sequences. (Running on oeis4.)