id:A026352 - OEIS Search Results

Search: id:A026352

Displaying 1-1 of 1 results found.

page 1

[ n*tau ]+n+1.

+0
7

1, 3, 6, 8, 11, 14, 16, 19, 21, 24, 27, 29, 32, 35, 37, 40, 42, 45, 48, 50, 53, 55, 58, 61, 63, 66, 69, 71, 74, 76, 79, 82, 84, 87, 90, 92, 95, 97, 100, 103, 105, 108, 110, 113, 116, 118, 121, 124, 126, 129, 131, 134, 137, 139, 142, 144 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`a(n) = greatest k such that s(k) = n+1, where s = A026350.` `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` `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` `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`
	CROSSREFS	`Essentially same as A004957.` `Sequence in context: A122437 A090848 A004957 this_sequence A047399 A057349 A087068` `Adjacent sequences: A026349 A026350 A026351 this_sequence A026353 A026354 A026355`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research