login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204983 a(n) = 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.
(Conjecture) Equivalently, the solution set of 2^p * (2^q - 1) = x * y, OR 2^q - 1 = 2^p * x * y, for at most one of the naturals x and y being given; unknown p and q in the integers; then a(n) = 2^p * (2^q - 1) where p and q are directly related to n (see formula). - Andrew T. Porter, Dec 20 2022
LINKS
FORMULA
Conjecture: a(n) = 2^A007814(n) * (2^A007733(n) - 1). - Andrew T. Porter, Dec 20 2022
MATHEMATICA
(See the program at A204979.)
PROG
(PARI) a(n) = for (k=1, oo, for (j=1, k-1, my(d=2^(k-1)-2^(j-1)); if (!(d % n), return(d)); ); ); \\ Michel Marcus, Sep 16 2023
CROSSREFS
Sequence in context: A134916 A085100 A337117 * A249623 A367742 A251637
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)