A204991 - cp's OEIS frontend

A204991 2^k-2^j, where (2^k,2^j) is the least pair of distinct positive powers of 2 for which n divides 2^k-2^j.

%I A204991 #5 Mar 30 2012 18:58:09
%S A204991 2,2,6,4,30,6,14,8,126,30,2046,12,8190,14,30,16,510,126,524286,60,126,
%T A204991 2046,4094,24,2097150,8190,524286,28,536870910,30,62,32,2046,510,8190,
%U A204991 252,137438953470,524286,8190,120,2097150,126,32766,4092,8190
%N A204991 2^k-2^j, where (2^k,2^j) is the least pair of distinct positive powers of 2 for which n divides 2^k-2^j.
%C A204991 For a guide to related sequences, see A204892.
%t A204991 (See the program at A204987.)
%Y A204991 Cf. A204987, A204892, A204990=(1/2)(A204991).
%K A204991 nonn
%O A204991 1,1
%A A204991 _Clark Kimberling_, Jan 21 2012

cp's OEIS Frontend

A204991 2^k-2^j, where (2^k,2^j) is the least pair of distinct positive powers of 2 for which n divides 2^k-2^j.