Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052006
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A052006
%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 n for which Fibonacci(n) 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 - comment from 
               Patrick De Geest.
%C A052006 Those n for which F(n-1) < 2^([ log2(F(n)) ]) and F(n+1) >= 2^([ log2(F(n)) 
               ]+1) and F(n+2) >= 2^([ log2(F(n)) ]+2).
%Y A052006 The first differences are A051392. Cf. A052005, A000045, A050815, A036284, 
               A037093.
%Y A052006 Sequence in context: A146872 A146792 A124884 this_sequence A002675 A087166 
               A095748
%Y A052006 Adjacent sequences: A052003 A052004 A052005 this_sequence A052007 A052008 
               A052009
%K A052006 nonn,base,nice
%O A052006 0,1
%A A052006 Antti Karttunen and Patrick De Geest (pdg(AT)worldofnumbers.com), Nov 
               15 1999.

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research