id:A020912 - OEIS Search Results

Search: id:A020912

Displaying 1-1 of 1 results found.

page 1

A020912

Number of terms in base 4 representation of n-th Fibonacci number.

+0
1

1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 21, 21, 21, 22, 22, 22, 23, 23, 24, 24, 24, 25, 25, 25, 26, 26, 26, 27, 27 (list; graph; listen)

	OFFSET	`1,5`
	FORMULA	`a(n) = A110591(A000045(n)). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 18 2008`
	MAPLE	`A020912 := proc(n) nops(convert(combinat[fibonacci](n), base, 4)) ; end: seq(A020912(n), n=1..120) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 18 2008`
	CROSSREFS	`Sequence in context: A008620 A104581 A113675 this_sequence A099199 A062276 A053264` `Adjacent sequences: A020909 A020910 A020911 this_sequence A020913 A020914 A020915`
	KEYWORD	`nonn,base,easy`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`
	EXTENSIONS	`More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 18 2008`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research