id:A074723 - OEIS Search Results

Search: id:A074723

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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; listen)

	OFFSET	`1,1`
	COMMENT	`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: A010466 A086396 A098471 this_sequence A063077 A085192 A006085` `Adjacent sequences: A074720 A074721 A074722 this_sequence A074724 A074725 A074726`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 04 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research