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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079665 Numbers of the form (2^s+1)/(2^r+1) for s>1, 1<=r<=s-1. 3
3, 11, 13, 43, 171, 57, 205, 683, 241, 2731, 3277, 10923, 3641, 993, 43691, 52429, 4033, 174763, 61681, 699051, 233017, 16257, 838861, 2796203, 65281, 11184811, 1016801, 13421773, 44739243, 14913081, 261633, 15790321, 178956971, 214748365 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Conjecture: (b^s+1)/(b^r+1) is an integer if and only if: 1) r<s/2, 2) if s==1 (mod 2) then r is divisor of s, 3) if s=k*2^t with gcd(k,2^t)=1 then r is 2^t*u with u dividing k

EXAMPLE

a(2)=11 because (2^6+1)/(2^1+1) = 33/3 = 11 and this is the second such number (ordering by s and r, not by values of a(n)).

PROG

(PARI) for(x=2, 30, for(y=1, x-1, if(Mod(2^x+1, 2^y+1), 0, print1((2^x+1)\(2^y+1)", "))))

CROSSREFS

Cf. A079672, A079581, A079673.

Sequence in context: A168454 A181086 A113049 * A083992 A105290 A201426

Adjacent sequences:  A079662 A079663 A079664 * A079666 A079667 A079668

KEYWORD

nonn

AUTHOR

Jose R. Brox (tautocrona(AT)terra.es), Jan 25 2003

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 14:37 EST 2012. Contains 205930 sequences.