Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Feb 18 2024 12:42:27
%S 3,11,13,43,171,57,205,683,241,2731,3277,10923,3641,993,43691,52429,
%T 4033,174763,61681,699051,233017,16257,838861,2796203,65281,11184811,
%U 1016801,13421773,44739243,14913081,261633,15790321,178956971,214748365
%N Triangular array read by rows: row s contains integers of the form (2^s+1)/(2^r+1) in order of increasing r <= s-1.
%C 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
%e s=2: no terms
%e s=3: 3
%e s=4: no terms
%e s=5: 11
%e s=6: 13
%e s=7: 43
%e s=8: no terms
%e s=9: 171, 57
%e ...
%o (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)","))))
%Y Cf. A079672, A079581, A079673, A370425.
%K nonn,tabf
%O 1,1
%A Jose R. Brox (tautocrona(AT)terra.es), Jan 25 2003
%E Definition corrected by _Max Alekseyev_, Feb 18 2024