A074723 - OEIS

This site is supported by donations to The OEIS Foundation.

A074723

Largest power of 2 dividing F(3n) where F(k) is the k-th Fibonacci number.

2, 8, 2, 16, 2, 8, 2, 32, 2, 8, 2, 16, 2, 8, 2, 64, 2, 8, 2, 16, 2, 8, 2, 32, 2, 8, 2, 16, 2, 8, 2, 128, 2, 8, 2, 16, 2, 8, 2, 32, 2, 8, 2, 16, 2, 8, 2, 64, 2, 8, 2, 16, 2, 8, 2, 32, 2, 8, 2, 16, 2, 8, 2, 256, 2, 8, 2, 16, 2, 8, 2, 32, 2, 8, 2, 16, 2, 8, 2, 64, 2, 8, 2, 16, 2, 8, 2, 32, 2, 8, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`if m=1 or 2 (mod 3) F(m) is odd.`
	FORMULA	`It appears that 4 never appears and : a(2k+1)=2 a(2^m*(2k+1))=2^(m+2) for k>=0 and m >=1.`
	CROSSREFS	`Sequence in context: A086396 A195844 A098471 * A175183 A189217 A183037` `Adjacent sequences: A074720 A074721 A074722 * A074724 A074725 A074726`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 04 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.