The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258159 Numbers n such that A053645(n) (n with the most significant binary digit removed) divides A004526(n) (n with the least significant binary digit removed). 1

%I

%S 3,5,7,9,15,17,19,21,31,33,63,65,67,71,73,85,127,129,255,257,259,261,

%T 271,273,307,341,511,513,519,585,1023,1025,1027,1035,1055,1057,1117,

%U 1365,2047,2049,2071,2137,4095,4097,4099,4101,4103,4105,4109,4111,4117,4131,4135,4141,4159

%N Numbers n such that A053645(n) (n with the most significant binary digit removed) divides A004526(n) (n with the least significant binary digit removed).

%C Also, numbers of the form 2^k + d, where d is any divisor of (2^k - 1).

%H Ivan Neretin, <a href="/A258159/b258159.txt">Table of n, a(n) for n = 1..1091</a>

%t Flatten[Table[2^n + Divisors[2^n - 1], {n, 15}]]

%K nonn,base

%O 1,1

%A _Ivan Neretin_, Jul 26 2015

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.

Last modified September 30 03:03 EDT 2020. Contains 337432 sequences. (Running on oeis4.)