%I A026352
%S A026352 1,3,6,8,11,14,16,19,21,24,27,29,32,35,37,40,42,45,48,50,53,55,
%T A026352 58,61,63,66,69,71,74,76,79,82,84,87,90,92,95,97,100,103,105,
%U A026352 108,110,113,116,118,121,124,126,129,131,134,137,139,142,144
%N A026352 [ n*tau ]+n+1.
%C A026352 a(n) = greatest k such that s(k) = n+1, where s = A026350.
%C A026352 Indices at which blocks (0;1) occur in infinite Fibonacci word; i.e. 
               n such that A005614 (n)=0 and A005614(n+1)=1 - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Nov 15 2003
%C A026352 Except for the first term, these are the numbers whose lazy Fibonacci 
               representation (see A095791) includes both 1 and 2; thus A026352 
               is a subsequence of the lower Wythoff sequence, A001950. - Clark 
               Kimberling (ck6(AT)evansville.edu), Jun 10 2004
%C A026352 a(n) = n-th number k whose lazy Fibonacci representation (as in A095791) 
               has more summands than that of k-1. - Clark Kimberling (ck6(AT)evansville.edu), 
               Jun 12 2004
%Y A026352 Essentially same as A004957.
%Y A026352 Sequence in context: A122437 A090848 A004957 this_sequence A047399 A057349 
               A087068
%Y A026352 Adjacent sequences: A026349 A026350 A026351 this_sequence A026353 A026354 
               A026355
%K A026352 nonn
%O A026352 0,2
%A A026352 Clark Kimberling (ck6(AT)evansville.edu)