id:A161789 - OEIS Search Results

Search: id:A161789

Displaying 1-1 of 1 results found.

page 1

a(n) = the largest integer k such that {2^k -1} divides n.

+0
3

1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 1, 2, 1, 3, 4, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 3, 1, 4, 5, 1, 2, 1, 3, 2, 1, 1, 2, 1, 1, 3, 1, 1, 4, 1, 1, 2, 3, 1, 2, 1, 1, 2, 1, 3, 2, 1, 1, 4, 1, 5, 6, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 1, 4, 1, 3, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 4, 3, 1, 5, 1, 1, 2, 1, 3, 2, 1, 1, 2, 1, 1, 4 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`A161788(n) = 2^a(n) - 1. a(A161790(n)) = 1.`
	MAPLE	`A161789 := proc(n) for k from ilog2(n+1) to 0 by -1 do if n mod (2^k-1) = 0 then RETURN(k); fi; od: end: seq(A161789(n), n=1..120) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 27 2009]`
	CROSSREFS	`A000225, A161788, A161790` `Sequence in context: A133255 A145972 A152650 this_sequence A141289 A140191 A048207` `Adjacent sequences: A161786 A161787 A161788 this_sequence A161790 A161791 A161792`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jun 19 2009`
	EXTENSIONS	`Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 27 2009`

page 1

Search completed in 0.002 seconds

Last modified December 4 12:48 EST 2009. Contains 170310 sequences.

AT&T Labs Research