Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161788
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161788 a(n) = the largest integer of the form {2^k -1} that divides n. +0
3
1, 1, 3, 1, 1, 3, 7, 1, 3, 1, 1, 3, 1, 7, 15, 1, 1, 3, 1, 1, 7, 1, 1, 3, 1, 1, 3, 7, 1, 15, 31, 1, 3, 1, 7, 3, 1, 1, 3, 1, 1, 7, 1, 1, 15, 1, 1, 3, 7, 1, 3, 1, 1, 3, 1, 7, 3, 1, 1, 15, 1, 31, 63, 1, 1, 3, 1, 1, 3, 7, 1, 3, 1, 1, 15, 1, 7, 3, 1, 1, 3, 1, 1, 7, 1, 1, 3, 1, 1, 15, 7, 1, 31, 1, 1, 3, 1, 7, 3, 1, 1 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n) = 2^A161789(n) - 1. a(A161790(n)) = 1.

MAPLE

A161788 := proc(n) for k from ilog2(n+1) to 0 by -1 do if n mod (2^k-1) = 0 then RETURN(2^k-1); fi; od: end: seq(A161788(n), n=1..120) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 27 2009]

CROSSREFS

A000225, A161789, A161790

Sequence in context: A125127 A058735 A107294 this_sequence A140211 A097706 A132740

Adjacent sequences: A161785 A161786 A161787 this_sequence A161789 A161790 A161791

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

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research