A335968 Smallest number whose binary representation has exactly n 1 bits and for which the differences of pairs of positions of the 1 bits include all positive integers up to and including A005488(n).

3, 11, 83, 583, 9287, 17088645, 551906607361

Offset

2,1

Comments

Verified by brute-force search.

If A005488(9)=29, a(9)=690241543.

If A005488(10)=37, a(10)=18590862013118808193.

If A005488(11)=45, a(11)=2475880088154706432018350081.

If A005488(12)=51, a(12)=11331575459480141.

Links

Table of n, a(n) for n=2..8.

Mike Speciner, Python program for A335968

Example

For n=2, a(2)=3=0b11. The bit positions of the 1's are 0 and 1, and their difference is 1; A005488(2)= 1.
For n=3, a(3)=11=0b1011. The bit positions of the 1's are 0, 1, and 3, and we have 1=1-0, 2=3-1, and 3=3-0; A005488(3) = 3.

Prog

(Python) # See Mike Speciner link

Crossrefs

Cf. A005488.

Sequence in context: A136649 A342058 A062580 * A097495 A228034 A157980

Adjacent sequences: A335965 A335966 A335967 * A335969 A335970 A335971

Keyword

nonn,base,more

Author

Mike Speciner, Jul 02 2020

Status

approved