login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161789 a(n) = the largest integer k such that {2^k -1} divides n. 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; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

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: A152650 A184219 A180262 * A109671 A141289 A177219

Adjacent sequences:  A161786 A161787 A161788 * A161790 A161791 A161792

KEYWORD

nonn

AUTHOR

Leroy Quet, Jun 19 2009

EXTENSIONS

Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 27 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 08:49 EST 2012. Contains 205893 sequences.