id:A165277 - OEIS Search Results

Search: id:A165277

Displaying 1-1 of 1 results found.

page 1

Number of odd-indexed Fibonacci numbers in the Zeckendorf representation of n.

+0
6

0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 2, 3, 0, 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 2, 1, 1, 2, 2, 3, 2, 2, 3, 3, 4, 0, 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 2, 3, 0, 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 2, 1, 1, 2, 2, 3, 2 (list; graph; listen)

	OFFSET	`1,7`
	COMMENT	`We begin the indexing at 2; that is, 1=F(2), 2=F(3), 3=F(4), 5=F(5),...` `For a count of even-indexed Fibonacci summands, see A165276.`
	EXAMPLE	`6=5+1=F(5)+F(2), so that a(6)=1.`
	CROSSREFS	`Cf. A165276, A165278, A165279.` `Sequence in context: A091970 A093955 A081603 this_sequence A103612 A083913 A023670` `Adjacent sequences: A165274 A165275 A165276 this_sequence A165278 A165279 A165280`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), Sep 12 2009`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research