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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204983 2^(k-1)-2^(j-1), where (2^(k-1),2^(j-1)) is the least pair of distinct positive powers of 2 for which n divides 2^(k-1)-2^(j-1). 3
1, 2, 3, 4, 15, 6, 7, 8, 63, 30, 1023, 12, 4095, 14, 15, 16, 255, 126, 262143, 60, 63, 2046, 2047, 24, 1048575, 8190, 262143, 28, 268435455, 30, 31, 32, 1023, 510, 4095, 252, 68719476735, 524286, 4095, 120, 1048575, 126, 16383, 4092, 4095 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For a guide to related sequences, see A204892.

LINKS

Table of n, a(n) for n=1..45.

MATHEMATICA

(See the program at A204979.)

CROSSREFS

Cf. A204979, A204892.

Sequence in context: A102483 A134916 A085100 * A249623 A251637 A035047

Adjacent sequences:  A204980 A204981 A204982 * A204984 A204985 A204986

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 21 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 12:42 EDT 2019. Contains 322209 sequences. (Running on oeis4.)