id:A105307 - OEIS Search Results

Search: id:A105307

Displaying 1-1 of 1 results found.

page 1

Log base 2 of the number of divisors of Fibonacci[n] if that number is a power of 2, else -1.

+0
1

0, 0, 1, 1, 1, 2, 1, 2, 2, 2, 1, -1, 1, 2, 3, 3, 1, 4, 2, 4, 3, 2, 1, -1, -1, 2, 4, 4, 1, 6, 2, 4, 3, 2, 3, -1, 3, 3, 3, 6, 2, 6, 1, 5, 5, 3, 1, -1, 3, -1, 3, 4, 2, 7, 4, -1, 5, 3, 2, -1, 2, 3, 5, 6, 3, 6, 3, 5, 5, 7, 2, -1, 2, 4, -1, 5, 4, 7, 2, 9, 7, 3, 1, -1, 4, 3, 4, 9, 2, 11, -1, 6, 4, 2, 6, -1, 4, 5, 6, -1, 2, 7, 3, 7, 7, 3, 2, -1, 2, -1, 5, -1, 2, 9, 4, 6, 6, 5, 3 (list; graph; listen)

	OFFSET	`1,6`
	COMMENT	`It appears that the number of divisors of most Fibonacci numbers is a power of 2.`
	EXAMPLE	`F(6)=8 has 4 divisors {1,2,4,8}, so a(6)=log base 2 of 4=2`
	CROSSREFS	`Cf. A081979.` `Sequence in context: A138516 A026513 A106028 this_sequence A082070 A082071 A082902` `Adjacent sequences: A105304 A105305 A105306 this_sequence A105308 A105309 A105310`
	KEYWORD	`sign`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), May 03 2005`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research